{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

lecture_20

# lecture_20 - Introduction to Algorithms 6.046J/18.401J...

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

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

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

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

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

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

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

View Full Document
A flow on a network positive capacity flow 1: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
A flow on a network positive capacity flow 1: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

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

View Full Document
The maximum-flow problem Maximum-flow problem: Given a flow network G , find a flow of maximum value on G .
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern