PUBLIC

GraphNodeIterC::GraphNodeIterC(GraphTC &) GraphNodeIterC::GraphNodeIterC(void) GraphNodeIterC::GraphNodeIterC(const GraphNodeIterC &) GraphNodeIterC::~GraphNodeIterC(void) GraphNodeIterC::operator=(const GraphNodeIterC &) GraphNodeIterC::operator==(const GraphNodeIterC &) const GraphNodeIterC::operator!=(const GraphNodeIterC &) const GraphNodeIterC::Data(void) GraphNodeIterC::Data(void) const GraphNodeIterC::In(void) GraphNodeIterC::Out(void) GraphNodeIterC::First(void) GraphNodeIterC::Last(void) GraphNodeIterC::Next(void) GraphNodeIterC::Prev(void) GraphNodeIterC::NextCrc(void) GraphNodeIterC::PrevCrc(void) GraphNodeIterC::Nth(LongIntT) GraphNodeIterC::RelNth(LongIntT) GraphNodeIterC::IsValid(void) const GraphNodeIterC::Size(void) const GraphNodeIterC::Invalidate(void) GraphNodeIterC::Del(void) GraphNodeIterC::DelMoveNext(void) GraphNodeIterC::IsNodeValid(void) const GraphNodeIterC::IsIterValid(void) const

GraphNodeIterC<class NodeT,class EdgeT>
Node iterator.
include	"amma/GraphNode.hh"
User Level:	Default
Library:	Mgraph
Example:	exBiHash.cc
Section:	Containers.Graphs
In Scope:	std

Comments:
Iterates through all the nodes in a graph.

protected GraphNodeC

GraphNodeIterC(GraphTC<NodeT,EdgeT> & AGraph)

Constructor.

GraphNodeIterC()

Default constructor.

GraphNodeIterC(const GraphNodeIterC<NodeT,EdgeT> & Another)

~GraphNodeIterC()

Destructor.

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

Assigment.

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

Comparison.

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

Comparison.

NodeT & Data(void)

Access data.

const NodeT & Data(void) const

Access data.

GraphAdjIterC<NodeT,EdgeT> In()

Returns the iterator that is set to the first item of the list of the graph adjacencies in which this node is the target node.

GraphAdjIterC<NodeT,EdgeT> Out()

Returns the iterator that is set to the first item of the list of the graph adjacencies in which this node is the source node.

void First()

void Last()

void Next()

void Prev()

void NextCrc()

void PrevCrc()

void Nth(LongIntT n)

void RelNth(LongIntT n)

BooleanT IsValid() const

TBD. Tempory solution !! While IsValid is protected.

BaseDListC::ListSizeT Size() const

void Invalidate()

Invalidate handle, IsValid() will return false after this call until the handle is assigmed to another node.

void Del()

Unlinks edge from the graph and deletes it. The iterator will point to the previous edge in the graph edge list.

void DelMoveNext()

Unlinks edge from the graph and deletes it. The iterator will point to the next edge in the graph edge list.

BooleanT IsNodeValid() const

BooleanT IsIterValid() const