Visualizes a directed capacitated graph with flows f(u,v) on edges (solid) and the residual network (dashed). The animation steps through Ford–Fulkerson augmenting paths, pushing flow by the bottleneck residual capacity. In the final step it highlights the residual-reachable set S, the induced s–t cut (S,T), and the cut capacity, illustrating max-flow min-cut and the fact that a flow is maximum iff no augmenting path exists.
Uses a small fixed graph. Each ~0.9s step animates a packet along a chosen augmenting path, then applies augmentation once mid-step. Residual edges are generated from current flows (forward: c-f, backward: f). Minimum cut is computed by BFS reachability from s in the residual graph; cut capacity sums capacities of edges from S to T.