PUBLIC

BGraphAdjIterC::BGraphAdjIterC(BGraphNodeC &,Dir) BGraphAdjIterC::BGraphAdjIterC(const BGraphAdjIterC &) BGraphAdjIterC::Data(void) BGraphAdjIterC::Data(void) const BGraphAdjIterC::Edge(void) BGraphAdjIterC::Edge(void) const BGraphBaseAdjIterC::Next(void) BGraphBaseAdjIterC::IsElm(void) const BGraphBaseAdjIterC::Edge(void) BGraphBaseAdjIterC::Edge(void) const BGraphBaseAdjIterC::FarNodeH(void) const BGraphBaseAdjIterC::NearNodeH(void) const BGraphBaseAdjIterC::Dump(void)

BGraphAdjIterC<class NT,class ET>
BGraph Adjacency iterator.
include	"amma/BGEdgeIter.hh"
User Level:	Default
Library:	Branch
Example:	exBiHash.cc
Section:	Containers.Graphs.Branching
In Scope:	std

Parent Classes:

public BGraphBaseAdjIterC

BGraphAdjIterC(BGraphNodeC<NT,ET> & Node,Dir Way)

Constructor.

BGraphAdjIterC(const BGraphAdjIterC<NT,ET> & Oth)

Copy constructor.

ET & Data()

Access data.

const ET & Data() const

Constant access to data.

BGraphEdgeC<NT,ET> & Edge()

Access edge.

const BGraphEdgeC<NT,ET> & Edge() const

Access edge.

void Next()

Goto next.

BooleanT IsElm() const

At valid element ?

BGraphEdgeBaseC & Edge()

Access edge.

const BGraphEdgeBaseC & Edge() const

Access edge.

NodeHandleT FarNodeH() const

Get node handle at other end.

NodeHandleT NearNodeH() const

Get node handle for this end.

void Dump(void)

Dump to stdout.