PUBLIC

GraphConnIterC::GraphConnIterC(GraphNodeIterC &) GraphConnIterC::GraphConnIterC(GraphConnIterC &) GraphConnIterC::Node(void) GraphConnIterC::Data(void) GraphConnIterC::operator==(const GraphNodeIterC &) const GraphConnIterC::AddOpen(const GraphNodeIterC &) 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

GraphConnIterC<class NodeT,class EdgeT>
Connected node iterator.
include	"amma/GrConnIt.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 does not necessarily include the start point itself.

public GraphBaseConnIterC

GraphConnIterC(GraphNodeIterC<NodeT,EdgeT> & Nd)

Constructor

GraphConnIterC(GraphConnIterC<NodeT,EdgeT> & Oth)

Copy constructor

GraphNodeIterC<NodeT,EdgeT> Node(void)

Get a node iterator.

NodeT & Data(void)

Get some data.

BooleanT operator==(const GraphNodeIterC<NodeT,EdgeT> & Nd) const

At a particular node ?

void AddOpen(const GraphNodeIterC<NodeT,EdgeT> & Nd)

Add node to open list.

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.