Unformatted text preview: Prelab exercise: Please write your answer on the back of this sheet. For the following graph, compute the maximum ﬂow from node 1 to node 3 by trial-and-error. (The numbers on the arcs are capacities.) Can you give a convincing argument that you have found an optimal solution? Can you ﬁnd a cut of minimum capacity? What is the capacity of the minimum cut? What is the value of the maximum ﬂow? 1 2 3 4 5 1 4 2 5 1 2 2 3 2...
View Full Document
- Fall '05
- Flow network, Maximum flow problem, Max-flow min-cut theorem