demo-max-flow - Augm nting Path Algorithm e 2 0 4 0 8 0 9...

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

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

Unformatted text preview: Augm nting Path Algorithm e 2 0 4 0 8 0 9 flow 4 G: 0 10 0 10 2 0 6 0 0 10 0 10 capacity s 3 5 t Flow value= 0 1 Augm nting Path Algorithm e 2 0 4 0 X 8 8 0 9 flow 4 G: 8 X 0 10 0 10 2 0 6 0 0 10 8 X 0 10 capacity s 3 5 t Flow value= 0 2 4 8 4 Gf: 10 2 6 10 re sidual capacity s 10 3 9 5 10 t 2 Augm nting Path Algorithm e 2 0 4 8 8 0 X 2 9 4 G: 10 X 8 10 0 10 2 X 0 2 3 6 0 0 10 10 X 8 10 s 5 t Flow value= 8 2 4 8 4 Gf: 8 2 2 6 10 s 10 3 9 5 2 8 t 3 Augm nting Path Algorithm e 2 0 4 8 8 2 X 8 9 4 G: 10 10 0 X 6 10 2 2 6X 0 6 5 0 X 6 10 10 10 s 3 t Flow value= 10 2 4 8 4 Gf: 10 2 6 10 s 10 3 7 2 5 10 t 4 Augm nting Path Algorithm e 2 0 X 2 4 8 8 8 9 4 G: 10 10 6 X 8 10 2 X 2 0 3 6 6 6 X 8 10 10 10 s 5 t Flow value= 16 2 4 8 4 Gf: 10 2 6 4 6 s 4 6 3 1 8 5 10 t 5 Augm nting Path Algorithm e 2 2 X 3 4 8 X 7 8 8 X 9 9 4 G: 10 10 8 X 9 10 2 0 6 6 8 X 9 10 10 10 s 3 5 t Flow value= 18 2 2 2 8 4 Gf: 10 2 6 2 8 s 2 8 3 1 8 5 10 t 6 Augm nting Path Algorithm e 2 3 4 7 8 9 9 4 G: 10 10 9 10 2 0 6 6 9 10 10 10 s 3 5 t C capacity = 19 ut 3 2 Flow value= 19 1 7 1 4 Gf: 10 2 9 6 1 s 1 9 3 9 5 10 t 7 ...
View Full Document

This note was uploaded on 06/25/2009 for the course MATH MAT 400 taught by Professor Jamespotvein during the Fall '08 term at University of Toronto- Toronto.

Ask a homework question - tutors are online