Unformatted text preview: Everyone do both 2.3 and 2.4 2.3 Problem CLRS 26.1-9 2.4 Problem Solve the maximum ﬂow problem in the given ﬂow network using the Ford-Fulkerson algo-rithm. The numbers above the edges are capacities on the edges, node s is the source and node t is the sink. For each iteration of the algorithm, show two networks: both the current ﬂow f and the residual network G f . Also specify the minimum cut in the network when the algorithm is done. Problem 2 Page 1...
View Full Document
This note was uploaded on 02/29/2008 for the course IE 170 taught by Professor Ralphs during the Spring '07 term at Lehigh University .
- Spring '07