Tutorial_6 - IELM202 Tutorial 6 1/6/11 1. Find the Maximum...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
IELM202 Tutorial 6 1/6/11 1. Find the Maximum flow from the source to the destination Remark: Please specify each path and flow. Iteration 1: We consider an augmenting path 1 2 4 6, =4 Iteration 2: We consider an augmenting path 1 2 5 6, =1 1 2 3 4 5 6 4 2 2 5 3 4 3 3 4 1 2 3 4 5 6 4 5 3 5 3 2 4 5 1 1 1 2 3 4 5 6 5 4 2 2 5 3 source destination 7 3 Capacity
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
IELM202 Tutorial 6 1/6/11 Iteration 3: We consider an augmenting path 1 3 4 6, =2 Iteration 4: We consider an augmenting path 1 3 5 6, =2 The total flow is 9. 1 2 3 4 5 6 4 3 3 7 1 2 6 5 1 1 2 1 2 3 4 5 6 4 1 9 1 6 1 3 4 2 2
Background image of page 2
IELM202 Tutorial 6 1/6/11 2. A system of aqueducts that originate at three rivers (nodes R1, R2, and R3) and terminate at a major city (node T), where the other nodes are junction points in the
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/05/2011 for the course IELM IELM202 taught by Professor D during the Fall '10 term at HKUST.

Page1 / 4

Tutorial_6 - IELM202 Tutorial 6 1/6/11 1. Find the Maximum...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online