FF1 - The Ford-Fulkerson Augmenting Path Algorithm for the...

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

View Full Document Right Arrow Icon
1 The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem Thanks to Jim Orlin & MIT OCW
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 Ford-Fulkerson Max Flow 4 1 2 1 2 3 1 s 2 5 3 t This is the original network, plus reversals of the arcs.
Background image of page 2
3 Ford-Fulkerson Max Flow 4 1 1 2 1 2 3 1 s 2 5 3 t This is the original network, and the original residual network.
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 4 1 1 2 1 2 3 1 Ford-Fulkerson Max Flow Find any s-t path in G(x) s 2 5 3 t
Background image of page 4
5 4 2 1 Ford-Fulkerson Max Flow Determine the capacity of the path. Send units of flow in the path. Update residual capacities. 1 1 1 2 1 s 2 5 3 t
Background image of page 5

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

View Full DocumentRight Arrow Icon
6 4 2 1 Ford-Fulkerson Max Flow Find any s-t path 1 1 1 2 1 s 2 5 3 t
Background image of page 6
7 4 1 1 2 1 Ford-Fulkerson Max Flow 1 1 1 s 2 5 3 t Determine the capacity of the path. Send units of flow in the path. Update residual capacities.
Background image of page 7

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

View Full DocumentRight Arrow Icon
8 4 1 1 2 1 Ford-Fulkerson Max Flow 1 1 1 s 2 5 3 t Find any s-t path
Background image of page 8
9 1 1 4 1 1 Ford-Fulkerson Max Flow 1 1 s 2 5 3 t Determine the capacity of the path. Send units of flow in the path. Update residual capacities.
Background image of page 9

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

View Full DocumentRight Arrow Icon
10 1 1 4 1 1 2 Ford-Fulkerson Max Flow
Background image of page 10
Background image of page 11

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

View Full DocumentRight Arrow Icon
Background image of page 12
Background image of page 13

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

View Full DocumentRight Arrow Icon
Background image of page 14
Background image of page 15

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

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

This note was uploaded on 01/26/2011 for the course IEOR 4004 taught by Professor Sethuraman during the Fall '10 term at Columbia.

Page1 / 16

FF1 - The Ford-Fulkerson Augmenting Path Algorithm for the...

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

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