{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

CS223-0408-Flow - Maximum Flow Neil Tang CS223 Advanced...

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

View Full Document Right Arrow Icon
CS223 Advanced Data Structures and Algorithms 1 Maximum Flow Maximum Flow Neil Tang Neil Tang 4/8/2008 4/8/2008
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
CS223 Advanced Data Structures and Algorithms 2 Class Overview Class Overview The maximum flow problem Applications A greedy algorithm which does not work The Ford-Fulkerson algorithm Implementation and time complexity
Background image of page 2
CS223 Advanced Data Structures and Algorithms 3 The Maximum Flow Problem The Maximum Flow Problem The weight of a link (a.k.a link capacity ) indicates the maximum amount of flow allowed to pass through this link. The maximum flow problem: Given a weighted directed graph G, a source node s and sink t, find the maximum amount of flow that can pass from s to t and a corresponding feasible link flow allocation. Flow feasibility: Both the flow conservation constraint and the capacity constraint must be satisfied.
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
CS223 Advanced Data Structures and Algorithms 4 The Maximum Flow Problem The Maximum Flow Problem
Background image of page 4
CS223 Advanced Data Structures and Algorithms 5
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
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}