PUBLIC

BGraphBaseLinearIterC::BGraphBaseLinearIterC(BGraphBaseC &) 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)

BGraphBaseLinearIterC
Base Graph linear iterator.
include	"amma/BLinIter.hh"
User Level:	Default
Library:	Branch
Example:	exBiHash.cc
Section:	Containers.Graphs.Branching
In Scope:	std

Parent Classes:

public BGraphTypesC

BGraphLinearIterC

BGraphBaseC Graph;

Relavent graph.

StackG Open;

Queue of open nodes.

SArray1dC Mark;

Array of markers.

IntT NodesLeft;

Number of unprocessed nodes.

BGraphBaseLinearIterC(BGraphBaseC & 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.

NodeHandleT NodeH(void) const

Get some data.

void DoneNode(NodeHandleT Nd)