lab10 - Everyone do both 2.3 and 2.4 2.3 Problem CLRS...

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

IE170 Lab #10 Prof. Linderoth IE 170 – Problem Set #10: Maximum Flows Due Date: April 2, 2006. 11AM. 1 APSP 1.1 Problem Run the Floyd-Warshall Algorithm to compute the shortest path from each vertex to every other vertex in the given graph. Be sure to show your work. 2 Max Flow Something Like LP Do exactly one of problems 2.1 and 2.2. (This is because you might only know what a linear program is (in problem 2.2) if you have taken IE220). 2.1 Problem CLRS 26.1-7 2.2 Problem CLRS 26.1-8 Fun for Everyone
This is the end of the preview. Sign up to access the rest of the document.

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 .

Ask a homework question - tutors are online