Graphs and Graph Algorithms

Normal classes:

GraphC	Templated graphs.
GraphNodeIterC	Node iterator.
GraphNodeHC	Node handle.
GraphEdgeIterC	Edge iterator.
GraphLinearIterC	Linear graph iterator.
GraphAdjIterC	Adjacency iterator.
GraphConnIterC	Connected node iterator.

Normal functions:

operator <<(ostream &,const GraphC &)	Read graph from a stream.
operator >>(istream &,GraphC &)
GraphBestRoute(const GraphC &,GraphNodeHC,GraphNodeHC,CostT &,CostT (*EvalT)(const EdgeT & dat) )

Develop classes:

GraphBaseBodyC
GraphNodeBaseBodyC	The class GraphNodeBaseBodyC is a representation of graph node.
GraphEdgeBaseBodyC	The class GraphEdgeBaseBodyC represents one edge of graph.
GraphAdjIterBaseC	The class GraphAdjIterBaseC is the iterator of the list of graph adjacencies of a graph node.
GraphBaseC	Reference counted graph.
GraphAdjRepC	The class GraphAdjRepC represents a part of triple which is a basic element of graphs.
GraphNodeBaseC	Graph node handle.
GraphEdgeBaseC	Graph Edge handle.
GraphNodeDatC	Graph node data.
GraphEdgeDatC	Edge data.
GraphBaseLinearIterC	Iterate through nodes of an acyclic directed graph in an order consistant with the nodes direction.
GraphBaseConnIterC	Connected node iterator

Develop functions:

operator <<(ostream &,const GraphAdjRepC &)	The class GraphEdgeBaseBodyC represents one edge of graph.
operator <<(ostream &,const GraphEdgeBaseBodyC &)	The class GraphNodeBaseBodyC is a representation of graph node.