Here is a list of all documented files with brief descriptions:
[detail level 12345]
| include | |
| GraphLib | |
| algorithms | |
| bfs.h | Implements breadth-first search (BFS) algorithms for graph traversal and pathfinding |
| dfs.h | Implements depth-first search (DFS) algorithms for graph traversal and pathfinding |
| dijkstra.h | |
| kruskal.h | Implements Kruskal's algorithm to compute the Minimum Spanning Tree (MST) of a weighted undirected graph |
| prim.h | Implements Prim's algorithm to compute the Minimum Spanning Tree (MST) of a weighted undirected graph |
| tarjan.h | Implements Tarjan's algorithm for finding strongly connected components (SCCs) in a directed graph |
| internal | |
| abstract_graphs | |
| abstract_directed_graph.h | Defines the DirectedGraph class template extending the generic Graph base to implement directed graph behavior |
| abstract_graph.h | Defines the generic abstract Graph class template supporting directed/undirected and weighted/unweighted graphs |
| abstract_undirected_graph.h | Defines the UndirectedGraph class template extending the generic Graph base to implement undirected graph behavior |
| abstract_unweighted_graph.h | Defines the UnweightedGraph class template extending the generic Graph base to implement unweighted graph behavior |
| abstract_weighted_graph.h | Defines the WeightedGraph class template extending the generic Graph base to implement weighted graph behavior |
| adjacency_list.h | Generic adjacency list implementation for directed graphs |
| concepts.h | Defines C++20 concepts used for type constraints in the GraphLib library |
| edge.h | Defines the Edge and WeightedEdge structures used to represent edges in graphs |
| util.h | Utility structures used internally by GraphLib |
| graphs.h | Defines concrete graph types for the GraphLib library |