class_7_flow_networks(4).pdf - Flow networks Flow networks...

Info icon This preview shows pages 1–12. Sign up to view the full content.

View Full Document Right Arrow Icon
Flow networks Flow networks Definition of a flow The value of a flow Ford-Fulkerson MCMF Edmonds-Karp algorithm Applications Flow networks August 2, 2017
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 networks Flow networks Definition of a flow The value of a flow Ford-Fulkerson MCMF Edmonds-Karp algorithm Applications Overview 1 Flow networks Definition of a flow The value of a flow Ford-Fulkerson MCMF Edmonds-Karp algorithm Applications
Image of page 2
Flow networks Flow networks Definition of a flow The value of a flow Ford-Fulkerson MCMF Edmonds-Karp algorithm Applications Flow networks A Flow networks is a directed graph with a pair of special vertices s (source) and t (sink), in which each edge ( u , v ) E has a non-negative capacity c ( u , v ). The capacity of each edge is given by a function: c : E R 0 Our goal is to find a maximal flow from s to t such that in each edge ( u , v ) E we have at most ” c ( u , v ) flow”.
Image of page 3

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

View Full Document Right Arrow Icon
Flow networks Flow networks Definition of a flow The value of a flow Ford-Fulkerson MCMF Edmonds-Karp algorithm Applications Flow networks A Flow networks is a directed graph with a pair of special vertices s (source) and t (sink), in which each edge ( u , v ) E has a non-negative capacity c ( u , v ). The capacity of each edge is given by a function: c : E R 0 Our goal is to find a maximal flow from s to t such that in each edge ( u , v ) E we have at most ” c ( u , v ) flow”.
Image of page 4
Flow networks Flow networks Definition of a flow The value of a flow Ford-Fulkerson MCMF Edmonds-Karp algorithm Applications Example We might imagine a network of roads between cities, such that each road can allow some given number of cars per hour and we want to maximize the number of cars going from the city s to the city t .
Image of page 5

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

View Full Document Right Arrow Icon
Flow networks Flow networks Definition of a flow The value of a flow Ford-Fulkerson MCMF Edmonds-Karp algorithm Applications Flow networks Our goal is to find a maximal flow from s to t such that in each edge ( u , v ) E we have at most ” c ( u , v ) flow”.
Image of page 6
Flow networks Flow networks Definition of a flow The value of a flow Ford-Fulkerson MCMF Edmonds-Karp algorithm Applications Flow networks Our goal is to find a maximal flow from s to t such that in each edge ( u , v ) E we have at most ” c ( u , v ) flow”.
Image of page 7

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

View Full Document Right Arrow Icon
Flow networks Flow networks Definition of a flow The value of a flow Ford-Fulkerson MCMF Edmonds-Karp algorithm Applications Flow networks Our goal is to find a maximal flow from s to t such that in each edge ( u , v ) E we have at most ” c ( u , v ) flow”.
Image of page 8
Flow networks Flow networks Definition of a flow The value of a flow Ford-Fulkerson MCMF Edmonds-Karp algorithm Applications Flow networks Our goal is to find a maximal flow from s to t such that in each edge ( u , v ) E we have at most ” c ( u , v ) flow”.
Image of page 9

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

View Full Document Right Arrow Icon
Flow networks Flow networks Definition of a flow The value of a flow Ford-Fulkerson MCMF Edmonds-Karp algorithm Applications Flow networks For a vertex u V we will denote T - ( u ) = { w V | ( w , u ) E } And, we will denote T + ( u ) = { w V | ( u , w ) E }
Image of page 10
Flow networks Flow networks Definition of a flow The value of a flow Ford-Fulkerson MCMF
Image of page 11

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

View Full Document Right Arrow Icon
Image of page 12
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    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.

    Student Picture

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

  • Left Quote Icon

    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.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    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.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern