PUBLIC

BGraphNodeC::BGraphNodeC(const NT &) BGraphNodeC::Data(void) BGraphNodeC::Data(void) const BGraphNodeC::ID(void) const BGraphNodeC::operator ==(const BGraphNodeC &) const BGraphNodeC::Out(BGraphC &) BGraphNodeC::In(BGraphC &) BGraphNodeC::Hash(void) const BGraphNodeBaseC::ID(void) const BGraphNodeBaseC::Edge(Dir) BGraphNodeBaseC::Edges(Dir) BGraphNodeBaseC::Dump(ostream &) BGraphNodeBaseC::Hash(void) const BGraphNodeBaseC::In(void) BGraphNodeBaseC::Out(void) RCBodyC::References(void) const RCBodyC::Copy(void) const RCBodyC::DeepCopy(UIntT) const RCBodyC::IncRefCounter(void) RCBodyC::DecRefCounter(void)

public BGraphNodeBaseC

NT Dat;

BGraphNodeC(const NT & nData)

Constructor.

NT & Data()

Access data.

const NT & Data() const

Constant access to data.

IndexC ID() const

Get ID of node.

bool operator ==(const BGraphNodeC & oth) const

Are they the same node ?

BGraphAdjIterC<NT,ET> Out(BGraphC<NT,ET> & G)

Get links leaving node.

BGraphAdjIterC<NT,ET> In(BGraphC<NT,ET> & G)

Get links entering node.

UIntT Hash() const

Get hash value.

NodeHandleT ID() const

Get ID for node.

SmartPtrC<BGraphEdgeBaseC> & Edge(Dir Way)

Get edges.

BGraphEdgeBaseC * Edges(Dir Way)

Get edge lists.

void Dump(ostream & out)

Dump to stream.

UIntT Hash() const

Get hash value.

BGraphBaseAdjIterC In()

Iterate links goind into this node.

BGraphBaseAdjIterC Out()

Iterate links goind out of this node.

UIntT References() const

Access count of handles open to this object.

RCBodyC & Copy() const

Make copy of body.
This should be provided in derived classes. this funtion will issue an assertion failure if called.

RCBodyC & DeepCopy(UIntT levels = ((UIntT))) const

Make a deep copy of body.
This should be provided in derived classes. this funtion will issue an assertion failure if called.

void IncRefCounter()

Increment reference counter.

bool DecRefCounter()

Decrement reference counter.