01Ford-Fulkerson and the Max-Flow ProblemFord and Fulkerson turned network capacity into an augmenting-path algorithm and a duality theorem: keep pushing additional flow until no source-to-sink residual path remains.↗