PUBLIC

BGraphC::BGraphC(void) BGraphC::InsNode(const NT &) BGraphC::InsEdge(NodeHandleT,NodeHandleT,const ET &) BGraphC::InsEdge(BGraphNodeHC,BGraphNodeHC,const ET &) BGraphC::NodeObj(NodeHandleT) BGraphC::NodeObjH(NodeHandleT) BGraphC::NodeData(NodeHandleT) BGraphC::NoNodes(void) const BGraphC::BaseGraph(void) BGraphC::IsValid(NodeHandleT) const BGraphC::IsValid(void) const BGraphC::SetConst(void) BGraphC::BGraphC(BGraphBaseC &) BGraphC::DupNode(NodeHandleT)

public BGraphTypesC

BDAGraphC

SmartPtrC Base;

BGraphC()

Default constructor.

NodeHandleT InsNode(const NT & Data)

Add a node

BGraphEdgeC<NT,ET> & InsEdge(NodeHandleT From,NodeHandleT To,const ET & Data)

Add an edge

BGraphEdgeC<NT,ET> & InsEdge(BGraphNodeHC<NT,ET> From,BGraphNodeHC<NT,ET> To,const ET & Data)

Add an edge

BGraphNodeC<NT,ET> & NodeObj(NodeHandleT H)

Convert a NodeHandle to a node.

BGraphNodeHC<NT,ET> NodeObjH(NodeHandleT H)

Convert a NodeHandle to a node.

NT & NodeData(NodeHandleT H)

Access node data.

IntT NoNodes() const

Get number of nodes.

BGraphBaseC & BaseGraph()

Access base graph.

bool IsValid(NodeHandleT H) const

Check a node handle is valid. (For debuging.)

bool IsValid() const

Check its valid handle.

void SetConst(void)

Lock-out changes.

BGraphC(BGraphBaseC & BG)

Constructor.

void DupNode(NodeHandleT ID)

Duplicate node.