PUBLIC

BGraphC::BGraphC(void) BGraphC::BGraphC(const BGraphC &) 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::operator=(const BGraphC &) BGraphC::NoNodes(void) const BGraphC::BaseGraph(void) BGraphC::IsValid(NodeHandleT) const BGraphC::IsValid(void) const BGraphC::SetConst(void)

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

Parent Classes:

public BGraphTypesC

BDAGraphC

BGraphC()

Default constructor.

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

Copy 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.

const BGraphC<NT,ET> & operator=(const BGraphC<NT,ET> & Oth)

Assigment.

IntT NoNodes() const

Get number of nodes.

BGraphBaseC & BaseGraph()

Access base graph.

BooleanT IsValid(NodeHandleT H) const

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

BooleanT IsValid() const

Check its valid handle.

void SetConst(void)

Lock-out changes.