Max-Flow, Min-Cut
A lightweight execution-visualization book.
The Network
Flows and Capacities
An Augmenting Path
Ford-Fulkerson
The Residual Graph
Augment to the Max
The Cut
A Cut Bounds the Flow
Max-Flow, Min-Cut
Reading the Cut
Solved at Scale
A Bigger Network
Solved with Flow-Stream
Cross-Checking with the Cut
Honest Solver Scope