Ford-Fulkerson algorithm
= Ford-Fulkerson algorithm
{c}
{wiki}
The Ford-Fulkerson algorithm repeatedly augments a feasible flow along an <augmenting path>. When no such path remains, the source-reachable vertices in the <residual network> define a cut of capacity equal to the flow value, proving optimality by the <max-flow min-cut theorem>.