Spanning trees, flows and matchings

Minimum spanning trees (Kruskal, Prim), maximum flow and minimum cut (Edmonds-Karp), bipartite matching by augmenting paths, and Gale-Shapley stable matching.

• Edmonds–Karp algorithm
• Gale–Shapley algorithm
• Kruskal's algorithm
• Maximum bipartite matching
• Prim's algorithm

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.