Max Flow / Min Cut
Ford-Fulkerson / Edmonds-Karp algorithm animated. Max flow = Min cut (max-flow min-cut theorem). Source=S, Sink=T.
Flow / capacity
Min-cut edges
Augmenting path
Click Step to find augmenting paths. Each step pushes flow along the shortest path.