| NGraphLib | |
| NInternal | |
| CAdjacencyList | Represents a directed (by nature) Adjacency List Graph Structure |
| CDijkstraIterator | Iterator that incrementally explores the shortest paths from a start node using Dijkstra's algorithm |
| CDirectedGraph | A graph class representing directed graphs |
| CEdge | Represents an unweighted edge to a node identified by an ID |
| CGraph | Abstract base class for a generic graph structure |
| CPriorityPair | A pair combining a priority and a value, supporting comparison by priority |
| CUndirectedGraph | A graph class representing undirected graphs |
| CUnweightedGraph | A graph class representing unweighted graphs |
| CWeightedEdge | Represents a weighted edge to a node identified by an ID, with an associated weight |
| CWeightedGraph | A graph class representing weighted graphs |
| CUnweightedDirectedGraph | Directed graph with unweighted edges |
| CUnweightedUndirectedGraph | Undirected graph with unweighted edges |
| CWeightedDirectedGraph | Directed graph with weighted edges |
| CWeightedUndirectedGraph | Undirected graph with weighted edges |