fordfulkersonmaxflowalgorithm

fordfulkersonmaxflowalgorithm - 15.082 and 6.855J The...

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

View Full Document Right Arrow Icon
15.082 and 6.855J The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem
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 1 2 2 1 2 3 3 1 s 2 4 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 2 1 2 3 3 1 s 2 4 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 2 1 2 3 3 1 Ford-Fulkerson Max Flow Find any s-t path in G(x) s 2 4 5 3 t
Background image of page 4
2 1 3 5 4 1 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 2 3 2 1 s 2 4 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
2 1 3 6 4 1 1 Ford-Fulkerson Max Flow Find any s-t path 1 1 1 2 1 2 3 2 1 s 2 4 5 3 t
Background image of page 6
2 1 1 2 3 7 4 1 1 1 1 1 1 Ford-Fulkerson Max Flow 1 1 1 1 3 2 1 s 2 4 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
2 1 1 2 3 8 4 1 1 1 1 1 1 Ford-Fulkerson Max Flow 1 1 1 1 3 2 1 s 2 4 5 3 t Find any s-t path
Background image of page 8
1 1 1 1 1 3 9 1 4 1 2 2 1 1 Ford-Fulkerson Max Flow
Background image of page 9

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

View Full DocumentRight Arrow Icon
Image of page 10
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/15/2010 for the course IE 505 taught by Professor Yok during the Spring '10 term at Galatasaray Üniversitesi.

Page1 / 16

fordfulkersonmaxflowalgorithm - 15.082 and 6.855J The...

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

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