lecture_20

Lecture_20 - Introduction to Algorithms 6.046J/18.401J LECTURE 20 Network Flow I Flow networks Maximum-flow problem Flow notation Properties of

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

View Full Document Right Arrow Icon
Introduction to Algorithms 6.046J/18.401J L ECTURE 20 Network Flow I Flow networks Maximum-flow problem Flow notation Properties of flow Cuts Residual networks Augmenting paths Prof. Charles E. Leiserson
Background image of page 1

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

View Full DocumentRight Arrow Icon
Flow networks Definition. A flow network is a directed graph G = ( V , E ) with two distinguished vertices: a source s and a sink t . Each edge ( u , v ) E has a nonnegative capacity c ( u , v ) . If ( u , v ) E , then c ( u , v ) = 0 . © 2001–4 by Charles E. Leiserson Introduction to Algorithms November 24, 2004 L20.2
Background image of page 2
Flow networks Definition. A flow network is a directed graph G = ( V , E ) with two distinguished vertices: a source s and a sink t . Each edge ( u , v ) E has a nonnegative capacity c ( u , v ) . If ( u , v ) E , then c ( u , v ) = 0 . Example: s s t t 3 2 3 3 2 2 3 3 1 2 1 © 2001–4 by Charles E. Leiserson Introduction to Algorithms November 24, 2004 L20.3
Background image of page 3

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

View Full DocumentRight Arrow Icon
Flow networks Definition. A positive flow on G is a function p : V × V R satisfying the following: Capacity constraint: For all u , v V , 0 p ( u , v ) c ( u , v ) . Flow conservation: For all u V –{ s , t } , v u p ) u v p ) = 0 . ( , ( , v V v V © 2001–4 by Charles E. Leiserson Introduction to Algorithms November 24, 2004 L20.4
Background image of page 4
Flow networks Definition. A positive flow on G is a function p : V × V R satisfying the following: Capacity constraint: For all u , v V , 0 p ( u , v ) c ( u , v ) . Flow conservation: For all u V –{ s , t } , v u p ) u v p ) = 0 . ( , ( , v V v V The value of a flow is the net flow out of the source: v s p ) s v p ) . ( , ( , v V v V © 2001–4 by Charles E. Leiserson Introduction to Algorithms November 24, 2004 L20.5
Background image of page 5

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

View Full DocumentRight Arrow Icon
A flow on a network positive capacity flow 1 : 2:2 1:3 2:3 s s 0:1 1:3 2:3 1:2 t t 2:2 1:2 2:3 © 2001–4 by Charles E. Leiserson Introduction to Algorithms November 24, 2004 L20.6
Background image of page 6
A flow on a network positive capacity flow 1 : 2:2 1:3 2:3 s s 0:1 1:3 2:3 1:2 t t 2:2 u 2:3 1:2 Flow conservation (like Kirchoff’s current law): Flow into u is 2 + 1 = 3 . Flow out of u is 0 + 1 + 2 = 3 . The value of this flow is 1 – 0 + 2 = 3 . © 2001–4 by Charles E. Leiserson Introduction to Algorithms November 24, 2004 L20.7
Background image of page 7

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

View Full DocumentRight Arrow Icon
The maximum-flow problem Maximum-flow problem: Given a flow network G , find a flow of maximum value on G .
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/10/2008 for the course CSE 6.046J/18. taught by Professor Piotrindykandcharlese.leiserson during the Fall '04 term at MIT.

Page1 / 31

Lecture_20 - Introduction to Algorithms 6.046J/18.401J LECTURE 20 Network Flow I Flow networks Maximum-flow problem Flow notation Properties of

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

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