Class Hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 123]

CGraphLib::Internal::AdjacencyList< I, E >	Represents a directed (by nature) Adjacency List Graph Structure
CGraphLib::Internal::DijkstraIterator< G >	Iterator that incrementally explores the shortest paths from a start node using Dijkstra's algorithm
CGraphLib::Internal::Edge< I >	Represents an unweighted edge to a node identified by an ID
CGraphLib::Internal::WeightedEdge< I, W >	Represents a weighted edge to a node identified by an ID, with an associated weight
CGraphLib::Internal::Graph< D, I, E >	Abstract base class for a generic graph structure
CGraphLib::Internal::DirectedGraph< int, std::size_t, Internal::Edge< std::size_t > >
CGraphLib::UnweightedDirectedGraph< D, I >	Directed graph with unweighted edges
CGraphLib::Internal::DirectedGraph< int, std::size_t, Internal::WeightedEdge< std::size_t, double > >
CGraphLib::WeightedDirectedGraph< D, I, W >	Directed graph with weighted edges
CGraphLib::Internal::UndirectedGraph< int, std::size_t, Internal::Edge< std::size_t > >
CGraphLib::UnweightedUndirectedGraph< D, I >	Undirected graph with unweighted edges
CGraphLib::Internal::UndirectedGraph< int, std::size_t, Internal::WeightedEdge< std::size_t, double > >
CGraphLib::WeightedUndirectedGraph< D, I, W >	Undirected graph with weighted edges
CGraphLib::Internal::UnweightedGraph< int, std::size_t, Internal::Edge< std::size_t > >
CGraphLib::UnweightedDirectedGraph< D, I >	Directed graph with unweighted edges
CGraphLib::UnweightedUndirectedGraph< D, I >	Undirected graph with unweighted edges
CGraphLib::Internal::WeightedGraph< int, std::size_t, Internal::WeightedEdge< std::size_t, double > >
CGraphLib::WeightedDirectedGraph< D, I, W >	Directed graph with weighted edges
CGraphLib::WeightedUndirectedGraph< D, I, W >	Undirected graph with weighted edges
CGraphLib::Internal::DirectedGraph< D, I, E >	A graph class representing directed graphs
CGraphLib::Internal::UndirectedGraph< D, I, E >	A graph class representing undirected graphs
CGraphLib::Internal::UnweightedGraph< D, I, E >	A graph class representing unweighted graphs
CGraphLib::Internal::WeightedGraph< D, I, E >	A graph class representing weighted graphs
CGraphLib::Internal::PriorityPair< P, T >	A pair combining a priority and a value, supporting comparison by priority