Network Flow Simulator
Compare Ford-Fulkerson and Edmonds-Karp on the same directed capacity network.
Ready.
Ford-Fulkerson
Repeatedly finds any augmenting path in the residual graph. This demo uses depth-first search to choose that path.
Edmonds-Karp
Uses breadth-first search to choose the shortest augmenting path in number of edges, giving a polynomial O(VE²) bound.