PUBLIC

GraphAdjIterC::GraphAdjIterC(const GraphAdjIterC &) GraphAdjIterC::operator=(const GraphAdjIterC &) GraphAdjIterC::Data(void) GraphAdjIterC::Data(void) const GraphAdjIterC::Node1Data(void) GraphAdjIterC::Node2Data(void) GraphAdjIterC::SourceData(void) GraphAdjIterC::TargetData(void) GraphAdjIterC::Node1(void) GraphAdjIterC::Node2(void) GraphAdjIterC::Node(void) GraphAdjIterC::OtherNode(void) GraphAdjIterC::NodeH(void) GraphAdjIterC::OtherNodeH(void) GraphAdjIterC::Source(void) GraphAdjIterC::Target(void) GraphAdjIterC::SourceH(void) GraphAdjIterC::TargetH(void) GraphAdjIterC::Edge(void) GraphAdjIterC::First(void) GraphAdjIterC::Last(void) GraphAdjIterC::Next(void) GraphAdjIterC::Prev(void) GraphAdjIterC::NextCrc(void) GraphAdjIterC::PrevCrc(void) GraphAdjIterC::Nth(LongIntT) GraphAdjIterC::RelNth(LongIntT) GraphAdjIterC::Size(void) const GraphAdjIterC::Del(void) GraphAdjIterC::DelMoveNext(void)

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

Parent Classes:

protected GraphAdjC

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

Copy constructor.

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

Assigment.

EdgeT & Data(void)

Access data.

const EdgeT & Data(void) const

Constant access to data.

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> Node1(void)

Get a node from an undirected graph

GraphNodeIterC<NodeT,EdgeT> Node2(void)

Get a node from an undirected graph

GraphNodeIterC<NodeT,EdgeT> Node(void)

See GraphAdjC::Node()

GraphNodeIterC<NodeT,EdgeT> OtherNode(void)

See GraphAdjC::OtherNode()

GraphNodeHC<NodeT,EdgeT> NodeH(void)

See GraphAdjC::Node()

GraphNodeHC<NodeT,EdgeT> OtherNodeH(void)

See GraphAdjC::OtherNode()

GraphNodeIterC<NodeT,EdgeT> Source(void)

Get source node.

GraphNodeIterC<NodeT,EdgeT> Target(void)

Get target node.

GraphNodeHC<NodeT,EdgeT> SourceH()

Get source node handle.

GraphNodeHC<NodeT,EdgeT> TargetH()

Get target node handle.

GraphEdgeIterC<NodeT,EdgeT> Edge(void)

Get associated edge.

void First()

void Last()

void Next()

void Prev()

void NextCrc()

void PrevCrc()

void Nth(LongIntT n)

void RelNth(LongIntT n)

BaseDListC::ListSizeT Size() const

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.