General · Networks · flow

Max flow = min cut

Push flow from source to sink, path by path. When nothing more will go, the total equals the capacity of the bottleneck cut.

Source S Sink T Saturated (flow = capacity)

Grow the flow

Each press sends as much as possible along one unused path. Saturated edges turn amber. Paths stay listed below.

Paths sent

None yet — start with Send flow.

Working

Every unit of flow must cross some cut. Grow the flow until it jams — then the cut capacity that matches is a minimum cut, and that shared number is the maximum flow.