Graphs and Trees
Graphs
- Breadth First Search
- Depth First Search
- Topological Sort (DFS)
- Topological Sort (Kahn)
- Cycles
- Eulerian Paths and Tours
- Kosaraju's Strongly Connected Components
- Ford-Fulkerson's Maximum Flow
- Dijkstra'a Shortest Paths (Greedy)
- Bellman-Ford's Shortest Paths (Dynamic Programming)
- Floyd Warshall's Shortest Paths (Dynamic Programming)
- Prim's Minimum Spanning Tree (Greedy)
- Kruskal's Minimum Spanning Tree (Greedy)