PDF4PRO ⚡AMP

Modern search engine that looking for books and documents around the web

Example: barber

Lecture 20 Max-Flow Problem and Augmenting Path Algorithm

Lecture 20 Max-Flow Problemand Augmenting path AlgorithmOctober 28, 2009 Lecture 20 Outline Max-Flow Problem Description Some examples Algorithm for solving Max-Flow Problem Augmenting path algorithmOperations Research Methods1 Lecture 20 Max-Flow Problem : Single-Source Single-SinkWe are given a directed capacitated network(V, E, C)connecting a source(origin) node with a sink (destination) setVis the set of nodes in the setEis the set of directed links(i, j)The setCis the set of capacitiescij 0of the links(i, j) Problem is to determine themaximum amount of flowthat can besent from the source node to the sink isMax-Flow Problemfor single-source and single-sinkOperations Research Methods2 Lecture 20 Max-Flow Problem .

Lecture 20 Outline • Max-Flow problem • Description • Some examples • Algorithm for solving max-flow problem • Augmenting path algorithm Operations Research Methods 1

Tags:

  Problem, Flows, Path, Flow problem

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Spam in document Broken preview Other abuse

Transcription of Lecture 20 Max-Flow Problem and Augmenting Path Algorithm

Related search queries