PUBLIC

BGraphLinearIterC::BGraphLinearIterC(BGraphC &) BGraphLinearIterC::NodeObj(NodeHandleT) BGraphLinearIterC::Node(void) BGraphLinearIterC::Data(void) BGraphBaseLinearIterC::First(void) BGraphBaseLinearIterC::Next(void) BGraphBaseLinearIterC::IsElm(void) const BGraphBaseLinearIterC::IsCycle(void) const BGraphBaseLinearIterC::NodesRemaining(void) const BGraphBaseLinearIterC::NodeH(void) const BGraphBaseLinearIterC::DoneNode(NodeHandleT)

public BGraphBaseLinearIterC

BGraphLinearIterC(BGraphC<NT,ET> & aGraph)

Construct.

BGraphNodeC<NT,ET> & NodeObj(NodeHandleT H)

Convert a handle to a node.

BGraphNodeC<NT,ET> & Node()

Get current node.

NT & Data()

Access data in current node.

bool First()

Goto first.
Returns false if list is empty, true otherwise.

bool Next()

Goto next.
Return true if it at a valid element after operation.

bool IsElm() const

At a valid element ?
Returns true if iterator is at a valid element.

bool IsCycle() const

Is graph cyclic ?
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.

NodeHandleT NodeH(void) const

Get some data.

void DoneNode(NodeHandleT Nd)