Maximum flow problem (Ford-fulkerson algorithm)

Maximum flow problem

for a detailed analysis and theory of the maximum flow problem, see the introduction to the algorithm, Ford-fulkerson algorithm, pseudo code as follows:Set ftotal= 0Repeat until there is no path from S to T:Run DFS from S to find a flow path to Tlet CP is the minimum capacity value on the pathADD cp to ftotal For each edge U-v on the path:Decrease C (u,v) by CP increase C (v,u) by CP

The following is a concrete example of how the algorithm executes.



Reference: (1) "Introduction to Algorithms" P404;

Maximum flow problem (Ford-fulkerson algorithm)