The maximum-flow problem Maximum-flow problem: Given a flow network G. find a flow of maximum value on g 2:2 2:3 2:3 0:3 2:3|1:2 2:2 2:2 3:3 The value of the maximum flow is 4 c 2001 by Charles E Leiserson Introduction to Agorithms Day38L22.5© 2001 by Charles E. Leiserson Introduction to Algorithms Day 38 L22.5 The maximum-flow problem ss tt 2:3 2:2 2:3 1:12:3 1:2 2:2 3:3 0:1 0:3 2:2 The value of the maximum flow is 4. Maximum-flow problem: Given a flow network G, find a flow of maximum value on G