lect13 - Lecture 13 Introduction to Maximum Flows Flow...

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

View Full Document Right Arrow Icon
Lecture 13 Introduction to Maximum Flows
Background image of page 1

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

View Full Document Right Arrow Icon
Flow Network A flow network ( , ) is a directed graph in which each edge ( , ) has a nonnegative capacity ( , ) 0. We distinguish two nodes: a source and a sink . A flow in is a function : such tha G V E x y E u x y s t G f V V R = × t (Capacity constraint) ( , ) ( , ) for all , , (Skew symmetry) ( , ) ( , ) for all , , (Flow conservation) ( , ) 0 for all { , }. | | ( , ) ( ( )) y V y V f x y u x y x y V f x y f y x x y V f x y x V s t f f s y v f = - = - = =
Background image of page 2
3
Background image of page 3

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

View Full Document Right Arrow Icon
Background image of page 4
Background image of page 5

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

View Full Document Right Arrow Icon
Background image of page 6
Background image of page 7

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

View Full Document Right Arrow Icon
Background image of page 8
Background image of page 9

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

View Full Document Right Arrow Icon
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 Document Right Arrow Icon
The Ford Fulkerson Maximum Flow Algorithm Begin x := 0; create the residual network G(x); while there is some directed path from s to t in G(x) do begin let P be a path from s to t in G(x); := δ (P); send units of flow along P; update the r's; End end {the flow x is now maximum}.
Background image of page 12
The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem
Background image of page 13

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

View Full Document Right Arrow Icon
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 14
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 15

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

View Full Document Right Arrow Icon
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 16
Image of page 17
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 56

lect13 - Lecture 13 Introduction to Maximum Flows Flow...

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

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