An algorithm that uses Ford-Fulkerson Method to solve the Maximum Flow Problem by using Breadth-First Search.
Running time
The total running time is as proved in CLRS pp. 729-730.
Examples
Example where each row is a new iteration. The residual graph with
flow on the edges is shown to the left and the original graph with flow/capacity is shown to the right.
