{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Tutorial_6

Tutorial_6 - IELM202 Tutorial 6 1 Find the Maximum flow...

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

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

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

View Full Document
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
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

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 4

Tutorial_6 - IELM202 Tutorial 6 1 Find the Maximum flow...

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

View Full Document
Ask a homework question - tutors are online