Graph Algorithms
Topological Sort
BFS / DFS
Bipartite Graph
Dijkstra's Shortest Path Algorithm
Bellman-Ford Shortest Path Algorithm (Supports Negative Edge Weights)
Floyd-Warshall (All Pairs Shortest Path)
Bridge Algorithm (Detecting Cut Edges)
Tarjan's Strongly Connected Components Algorithm
Eulerian Paths and Circuit Algorithm
Prim's MST Algorithm