DSA Maximum Flow

The maximum flow problem looks for the maximum current value that can be sent from source to destination on a weighted network called a flow network. The key concept is path augmentation and residual capacity: as long as there is still a path with positive residual capacity, the current can be increased. The max-flow min-cut theorem ensures that the maximum current is equal to the minimum cutting capacity.