PUBLIC

GraphLinearIterC::GraphLinearIterC(GraphC &) GraphLinearIterC::Node(void) GraphLinearIterC::Data(void) GraphBaseLinearIterC::First(void) GraphBaseLinearIterC::Next(void) GraphBaseLinearIterC::operator ++(int) GraphBaseLinearIterC::operator ++(void) GraphBaseLinearIterC::IsElm(void) const GraphBaseLinearIterC::operator bool(void) const GraphBaseLinearIterC::IsCycle(void) const GraphBaseLinearIterC::NodesRemaining(void) const GraphBaseLinearIterC::Node(void) GraphBaseLinearIterC::Node(void) const GraphBaseLinearIterC::DoneNode(GraphNodeBaseC &)

Expects the graph to be acyclic.

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.

public GraphBaseLinearIterC

GraphLinearIterC(GraphC<NodeT,EdgeT> & AGraph)

Constructor

GraphNodeIterC<NodeT,EdgeT> Node(void)

Get a node iterator.

NodeT & Data(void)

Get some data.

bool First()

Goto first.

bool Next()

Goto next node.
AMMA compatability function, use ++

void operator ++(int)

Goto next node.

bool operator ++()

Goto next node.
Return true if it is a valid element.

bool IsElm() const

At a valid element ? AMMA compatability function, use 'operator bool()'

operator bool() const

Test if the iterator is valid.

bool 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.

GraphNodeBaseC & Node(void)

Get current node.

const GraphNodeBaseC & Node(void) const

Get current node.

void DoneNode(GraphNodeBaseC & Nd)