{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

hw5 - Introduction to Algorithms CS 482 Spring 2006 Problem...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Introduction to Algorithms Problem Set 5 CS 482 Spring 2006 Due: Friday, March 10 Please 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 together Reading: Chapters 7.1 - 7.3, 7.5 and 7.7. Question 1 This question refers to the figure on the back of this sheet. Please show your work on this figure and hand it in for your solution to Question 3. At the top of the page you’ll find a flow network G . We basically want you to simulate the main steps of the basic Ford Fulkerson algorithm and compute the maximum s - t flow in G . In particular, you should specify the path P you pick to augment along, the resulting flow f , and the resulting residual graph G f at 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
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Ask a homework question - tutors are online