PUBLIC

GraphBaseLinearIterC::GraphBaseLinearIterC(GraphC &) GraphBaseLinearIterC::First(void) GraphBaseLinearIterC::Next(void) GraphBaseLinearIterC::IsElm(void) const GraphBaseLinearIterC::IsCycle(void) const GraphBaseLinearIterC::NodesRemaining(void) const GraphBaseLinearIterC::Node(void) GraphBaseLinearIterC::Node(void) const

GraphBaseLinearIterC
Iterate through nodes of an acyclic directed graph in an order consistant with the nodes direction.
include	"amma/GraphBaseLinearIter.hh"
User Level:	Default
Library:	Mgraph
Example:	exBiHash.cc
Section:	Containers.Graphs
In Scope:	std

Comments:
This effectively does a toplogical sort on the graph.

NB. This class uses the node Markers !! So you can only use single iter at a time.

GraphLinearIterC

GraphBaseLinearIterC(GraphC & AGraph)

Constructor

BooleanT First()

Goto first.

BooleanT Next()

Goto next.

BooleanT IsElm() const

At a valid element ?

BooleanT IsCycle() const

Results only valid after iteration complete. i.e. IsElm() returns False.

IntT NodesRemaining() const

Return the number of unprocessed nodes. Directly after First(), this will be the number of nodes in the graph - 1.

GraphNodeC & Node(void)

Get some data.

const GraphNodeC & Node(void) const

Get some data.