C++17 sources of some of the most common algorithms in Graph Theory.
- Breadth-First-Search (Moore)
- Lee's Algorithm
- Roy-Floyd-Warshall
- Dijkstra's Algorithm
- Johnson's Algorithm
- Kruskal's Algorithm
- Fleury's Algorithm (for finding Eulerian Cycles)
- Maximum Flow with Ford-Fulkerson
- Maximum Flow with Push-Relabel method
- Push-Relabel with a supersource
- Kempe's Algorithm (Linear)
- Kempe's Algorithm (calculating the chromatic number) - UNSTABLE FOR BIGGER TESTS ~ dense graph with 200 or more vertices
- Huffman Coding / Decoding
- Prüfer Coding / Decoding