Graph Algorithms
a collection of readings compiled from Wikipedia
Graph search problems
Graph traversalTree traversal
Search algorithm
Breadth-first search
Depth-first search
Eulerian path
Bridge (graph theory)
More specialized search algorithms
Depth-limited searchIterative deepening depth-first search
Lexicographic breadth-first search
Uniform-cost search
Graph search applications
Bipartite graphConnected component (graph theory)
Biconnected component
Strongly connected component
Kosaraju's algorithm
Tarjan's strongly connected components algorithm
Path-based strong component algorithm
2-satisfiability
Shortest-path algorithms
Shortest path problemShortest path tree
Dijkstra's algorithm
Floyd–Warshall algorithm
Bellman–Ford algorithm
Johnson's algorithm
Shortest-path applications
Transitive closureSpanning trees
Minimum spanning treeKruskal's algorithm
Prim's algorithm
Borůvka's algorithm
Reverse-delete algorithm
Network flows
Flow networkMaximum flow problem
Circulation problem
Ford–Fulkerson algorithm
Edmonds–Karp algorithm
Dinic's algorithm
Push–relabel maximum flow algorithm
Minimum-cost flow problem
Nowhere-zero flow
Multi-commodity flow problem
Applications of maximum-flow
Max-flow min-cut theoremMenger's theorem
König's theorem (graph theory)
Hopcroft–Karp algorithm
Blossom algorithm
Karger's algorithm