Implements a graph data structure for directed and undirected graphs along with common graph algorithms. Supports usage with adjacency lists and adjacency matrices as the the underlying implementation. Written in C++.
- A*
- Dijkstra's algorithm
- Fleury's algorithm
- Ford-Fulkerson's algorithm
- Bellman-Ford's algorithm
- Hierholzer's algorithm