Containers with low cost copy constructors

These containers are designed to have very low copy times and are designed to be used in solving combinatorial search problems.

Normal classes:

BListIterC	BList iterator.
BListC	Branching list.
BStackC	Stack.
BDAGraphC	Directed acyclic graph.
BGraphAdjIterC	BGraph Adjacency iterator.
BGraphNodeHC	BGraph node handle
BGraphLinearIterC	Graph linear iterator.
BGraphC	Branching graph.
BGraphNodeIterC	Interate through nodes in a BGraph.
BGraphEdgeHC	BGraph edge handle.

Advanced classes:

BLinkC

Link in list.

Develop classes:

BLinkBodyC	Link and data.
BHashEntryC	Entry in the hash table.
BHashC	Branching hash table.
BGraphEdgeBaseC	Base Edge in BGraph.
BGraphBaseC	Base BGraph
BGraphNodeBaseC	Base Node in BGraph.
BGraphBaseAdjIterC	Adjacency iterator base class.
BGraphTypesC
BGraphEdgeC	BGraph Edge.
BGraphNodeC	BGraph node
BGraphBaseLinearIterC	Base Graph linear iterator.
BGraphBaseNodeIterC	Node iterator base class.

Default classes:

BHashIterC