Network Flow The Ford-Fulkerson Method: The previous theorem suggests a way to construct a maximum flow by iterative improvement a One keeps finding an augmenting path arbitrarily and increases the flow by its bottleneck capacityThe Ford-Fulkerson Method: ◼ The previous theorem suggests a way to construct a maximum flow by iterative improvement ◼ One keeps finding an augmenting path arbitrarily and increases the flow by its bottleneck capacity Network Flow