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.