← Lab · Chapter: Maximum flow

Maximum flow: Ford–Fulkerson and Edmonds–Karp

The residual network, the augmenting path (depth-first or breadth-first search), the bottleneck and the flow update; at the end the minimum cut, whose capacity equals the flow value. Choose the algorithm, the source and the sink; ◀ ▶ one step at a time, «Run» to watch them all; «Random» and «Edit…» change the network.