PUBLIC

GraphEdgeIterC::GraphEdgeIterC(GraphTC &) GraphEdgeIterC::GraphEdgeIterC(void) GraphEdgeIterC::GraphEdgeIterC(const GraphEdgeIterC &) GraphEdgeIterC::~GraphEdgeIterC(void) GraphEdgeIterC::operator=(const GraphEdgeIterC &) GraphEdgeIterC::operator==(const GraphEdgeIterC &) const GraphEdgeIterC::Data(void) GraphEdgeIterC::Data(void) const GraphEdgeIterC::Node1(void) GraphEdgeIterC::Node2(void) GraphEdgeIterC::Node1Data(void) GraphEdgeIterC::Node2Data(void) GraphEdgeIterC::SourceData(void) GraphEdgeIterC::TargetData(void) GraphEdgeIterC::Source(void) GraphEdgeIterC::Target(void) GraphEdgeIterC::SourceH(void) GraphEdgeIterC::TargetH(void) GraphEdgeIterC::First(void) GraphEdgeIterC::Last(void) GraphEdgeIterC::Next(void) GraphEdgeIterC::Prev(void) GraphEdgeIterC::NextCrc(void) GraphEdgeIterC::PrevCrc(void) GraphEdgeIterC::Nth(LongIntT) GraphEdgeIterC::RelNth(LongIntT) GraphEdgeIterC::IsValid(void) const GraphEdgeIterC::Size(void) const GraphEdgeIterC::Invalidate(void) GraphEdgeIterC::Del(void) GraphEdgeIterC::IsEdgeValid(void) const GraphEdgeIterC::IsIterValid(void) const

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

Comments:
Iterates through the edges in a graph.

protected GraphEdgeC

GraphEdgeIterC(GraphTC<NodeT,EdgeT> & AGraph)

Constructor.

GraphEdgeIterC()

Default Constructor.

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

~GraphEdgeIterC()

Destructor.

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

Assigment.

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

Comparison.

EdgeT & Data(void)

Access data.

const EdgeT & Data(void) const

Access data.

GraphNodeIterC<NodeT,EdgeT> Node1(void)

Get a node from an undirected graph

GraphNodeIterC<NodeT,EdgeT> Node2(void)

Get a node from an undirected graph

NodeT & Node1Data(void)

Get data from node 1.

NodeT & Node2Data(void)

Get data from node 2.

NodeT & SourceData(void)

Data from source node.

NodeT & TargetData(void)

Data from target node.

GraphNodeIterC<NodeT,EdgeT> Source(void)

Get source node iter.

GraphNodeIterC<NodeT,EdgeT> Target(void)

Get target node iter.

GraphNodeHC<NodeT,EdgeT> SourceH(void)

Get source node handle.

GraphNodeHC<NodeT,EdgeT> TargetH(void)

Get target node handle.

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 edge.

void Del()

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

BooleanT IsEdgeValid() const

BooleanT IsIterValid() const