Lecture 15: Network Flow
- Source s with outflow only
- Source t with inflow only
- Directed graph with non-negative edge capacities
The goal is the minimize the flow from s -> t. A flow is a function f:E -> R+, from the edge set to amount of flow on that edge. We also define ce to be the capacity of an edge e. To be a legal flow:
- For each edge, 0 <= f(e) <= ce
- For each node v other than s, t, fin(v) = fout(v)
The value of a flow f, v(f) = fin(t) = fout(s) = sum( f(e) ) of eout of s = sum( f(e) ) of ein of t. As you’ve seen by now, fin(v) = sum( f(e) ) of ein of v, and fout(v) = sum( f(e) ) of eout of v.
Here is an example of a network flow diagram:
Now, imagine pushing 18 units of flow across nodes {s, 1, 3, 4, t} to get the following flow diagram:
This is bad–it uses up too much of our capacity. The most we can push again from s -> t is only 2! Let’s allow the option of “undoing” an edge:
This is our redidual graph. Everywhere we have flow, we potentially have:
- Some capacity left
- Some “backflow” we can use to change our mind
Ford-Fulkerson Algorithm (Overview):
Find an s -> t path in graph
Update all flows
Make a new residual graph
Repeat
This entry was posted on Friday, February 25th, 2005 at 3:49 pm and is tagged with ford fulkerson, network flow, negative edge, flow diagram, backflow, inflow, fout, outflow, graph, algorithm, lt, ford. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback.
2 Responses to 'Lecture 15: Network Flow'
Leave a Reply
Please take time to enjoy the archives: May 2005 (1) April 2005 (11) March 2005 (11) February 2005 (15) January 2005 (7)
Fresh, related resources:
- Will post-sec embrace the open social?
As opposed to passive replication of lecture materials, a well designed online learning environment can go a long way to improving distance outcomes. Royal Roads, for example, blends short residencies with distance-based cohorts and has ... - #012: First day of school
I slept for like 2 hours! I look fine, but I was horribly exhausted. I downloaded my lecture notes. Get paper from my parents' room. Go to my brother's room to print my notes. Cos my computer is network-ed to his printer. ... - Seeking Network/System Administrator's job
Basic concept was to keep detail record of criminals with their crime record. Senior Lecturer ? Handled student computer lectures eg.. Computer basic concept, Flow charting, Algorithm, System Analysis, ASCII to Binary Conversion, ... - Advanced Algorithms Course at MIT
Techniques to be covered include amortization, randomization, fingerprinting, word-level parallelism, bit scaling, dynamic programming, network flow, linear programming, fixed-parameter algorithms, and approximation algorithms. ...
on April 12th, 2005 at 3:33 pm
“Now, imagine pushing 18 units of flow across nodes {s, 1, 2, 4, t} to get the following flow diagram:”
Should be { s, 1, 3, 4, t }
on April 12th, 2005 at 4:11 pm
Always the excellent proofist, you have prevailed!