Max Flow Ford Fulkerson | Network Flow | Graph Theory

3-Second Blueprint (English)

1. Ford-Fulkerson computes maximum s-t network flow by iteratively finding unsaturated augmenting paths in a residual graph.
2. Each augmentation adds the path's minimum remaining capacity (bottleneck) to forward flow while updating backward residual edges.
3. Backward residual edges allow later iterations to redirect prior flow choices, terminating at max flow when no s-t path remains.