PUBLIC

BGraphLinearIterC::BGraphLinearIterC(BGraphC &) BGraphLinearIterC::NodeObj(NodeHandleT) BGraphLinearIterC::Node(void) BGraphLinearIterC::Data(void) BGraphLinearIterC::NodeObj(BGraphTypesC::NodeHandleT) 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)

BGraphLinearIterC<class NT,class ET>
Graph linear iterator.
include	"amma/BLinIter.hh"
User Level:	Default
Library:	Branch
Example:	exBiHash.cc
Section:	Containers.Graphs.Branching
In Scope:	std

Comments:
This expects the grapg to be acyclic

public BGraphBaseLinearIterC

BGraphLinearIterC(BGraphC<NT,ET> & AGraph)

Constructor.

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.

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

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.

NodeHandleT NodeH(void) const

Get some data.

void DoneNode(NodeHandleT Nd)