PUBLIC

GraphBaseConnIterC::GraphBaseConnIterC(void) GraphBaseConnIterC::GraphBaseConnIterC(const GraphNodeC &) GraphBaseConnIterC::GraphBaseConnIterC(const GraphBaseConnIterC &) GraphBaseConnIterC::First(const GraphNodeC &) GraphBaseConnIterC::Next(void) GraphBaseConnIterC::Prune(void) GraphBaseConnIterC::IsElm(void) const GraphBaseConnIterC::IsVisited(const GraphNodeC &) const GraphBaseConnIterC::Visited(const GraphNodeC &) GraphBaseConnIterC::AddOpen(const GraphNodeC &) GraphBaseConnIterC::Data(void) GraphBaseConnIterC::Data(void) const

GraphBaseConnIterC
Connected node iterator
include	"amma/GrBConIt.hh"
User Level:	Default
Library:	Mgraph
Example:	exBiHash.cc
Section:	Containers.Graphs
In Scope:	std

Comments:
Iterate all nodes that maybe reached from the given starting point (This may not necessarily include the start point itself).

GraphConnIterC

HashARC Done;

Table of visited nodes.

BlkQueueG Open;

Stack of open nodes.

GraphBaseConnIterC()

Default constructor.

GraphBaseConnIterC(const GraphNodeC & Start)

Constructor.

GraphBaseConnIterC(const GraphBaseConnIterC & Oth)

Copy constructor.

void First(const GraphNodeC & Nd)

Goto first node.

void Next(void)

Goto next node, add current nodes outgoing links to those in the open list.

void Prune(void)

Move to next node, don't include this nodes children for iteration.

BooleanT IsElm(void) const

At valid element.

BooleanT IsVisited(const GraphNodeC & Nd) const

Have visited node ?

void Visited(const GraphNodeC & Nd)

Flag node as being visited.

BooleanT AddOpen(const GraphNodeC & Nd)

Add node to open list.

GraphNodeC & Data(void)

Get some data.

const GraphNodeC & Data(void) const

Get some data.