fordfulkersonmaxflowalgorithm

# fordfulkersonmaxflowalgorithm - 15.082 and 6.855J The...

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

15.082 and 6.855J The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem

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

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

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

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

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

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

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

View Full Document
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
1 1 1 1 1 3 9 1 4 1 2 2 1 1 Ford-Fulkerson Max Flow

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.

## 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
Ask a homework question - tutors are online