PUBLIC

BDAGraphC::BDAGraphC(void) BDAGraphC::BDAGraphC(const BDAGraphC &) BDAGraphC::TryEdge(BGraphTypesC::NodeHandleT,BGraphTypesC::NodeHandleT) BDAGraphC::TryEdge(BGraphNodeHC,BGraphNodeHC) BDAGraphC::InsEdge(BGraphTypesC::NodeHandleT,BGraphTypesC::NodeHandleT,const ET &) BDAGraphC::InsEdge(BGraphNodeHC,BGraphNodeHC,const ET &) 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)

public BGraphC<NT,ET>

BDAGraphC()

Default constructor.

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

Constructor.

bool TryEdge(BGraphTypesC::NodeHandleT fromNode,BGraphTypesC::NodeHandleT toNode)

Test if adding an edge is possible.

bool TryEdge(BGraphNodeHC<NT,ET> fromNode,BGraphNodeHC<NT,ET> toNode)

Test if adding an edge is possible.

BGraphEdgeHC<NT,ET> InsEdge(BGraphTypesC::NodeHandleT From,BGraphTypesC::NodeHandleT To,const ET & Data)

Add an edge, test if possible first.

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

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.