22 - Chapter 7.1 - The Maximum-Flow Problem and the Ford-Fulkerson Algorithm

# 22 - Chapter 7.1 - The Maximum-Flow Problem and the Ford-Fulkerson Algorithm

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

2/22 - Chapter 7.1 - The Maximum-Flo. .. Graphs to model transportation networks - networks whose edges carry some sort of tra f c and whose nodes act as “switches” passing tra f c between di F erent edges a highway system - edges are highways, nodes are interchanges Fuid network - edges are pipes that carry liquid, nodes are junctures where pipes are plugged together Ingredients: capacities on edges indicate how much they can carry source nodes generate tra f c sink (or destination) nodes can “absorb” tra f c as it arrives tra f c which is transmitted across the edges ±low Networks Fow = tra f c, an abstract entity that is generated at source nodes, transmitted across edges, and absorbed at sink nodes

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: a directed graph G = (V, E) with the following features Associated with each edge is a capacity, a nonnegative number, c e There is a single source node s V There is a single sink node t V Nodes other than s and t = internal nodes Assumptions No edge enters the source s and no edge leaves the sink t there is at least one edge incident to each node all capacities are integers 60-1 60 Defning Flow An s-t ow is a unction that maps each edge e to a nonnegative real number, : E -> R + ; the value (e) intuitively represents the amount o ow carried by an edge e A ow must satisy the ollowing two properties: 60-2...
View Full Document

## This note was uploaded on 10/02/2008 for the course CS 482 taught by Professor Kleinberg during the Spring '08 term at Cornell University (Engineering School).

### Page1 / 2

22 - Chapter 7.1 - The Maximum-Flow Problem and the Ford-Fulkerson Algorithm

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

View Full Document
Ask a homework question - tutors are online