Introduction to AlgorithmsProblem Set 5CS 482 Spring 2006Due: Friday, March 10Please hand in each problem on separate sheets with your name and netID on each.If a problem requires multiple sheets, please staple the sheets for that problem togetherReading:Chapters 7.1 - 7.3, 7.5 and 7.7.Question 1This question refers to the figure on the back of this sheet. Please show your work on this figure andhand it in for your solution to Question 3.At the top of the page you’ll find a flow networkG. We basically want you to simulate the mainsteps of the basic Ford Fulkerson algorithm and compute the maximums-tflow inG. In particular,you should specify the pathPyou pick to augment along, the resulting flowf, and the resultingresidual graphGfat each step. As the handy sheet suggests, you should only need three iterations.Finally, you should report the value of the maximum flow, and describe a minimum cut.Since the Ford Fulkerson algorithm is underspecified (in the sense that you can pick any path to
This is the end of the preview.
access the rest of the document.
Flow network, Maximum flow problem, Max-flow min-cut theorem, Ford Fulkerson, ford Fulkerson algorithm