(Latest Revision:
Apr 29, 2019)
Flow Network Problem
This exercise is due Tuesday, May 7. This one has to be
turned in on time in order to get participation credit. I'll come into class and go over the solution right away.
Then I will collect your work on the exercise. Be ready to turn it in at that time.
Make three copies of the worksheet. There are three links below for JPG, TIFF, and PDF versions. Use any version that is convenient.
the JPG version
the TIFF version
the PDF version
Use the worksheets to show, one path augmentation at a time, how to use the
Ford-Fulkerson Algorithm to compute a max flow and a min cut for the
flow network.
As you go along, write the flows for each edge in the little squares. When you reach the end of the algorithm,
shade in the nodes that are on the "A side" of the minimum cut.
You may want to review the Ford-Fulkerson Algorithm before starting
on the problem. Here is a link:
Ford-Fulkerson powerpoint demo
If asked, I'll briefly review the Ford-Fulkerson procedure on Tuesday, April 30. (I'll just go over some of the steps in the powerpoint demo.)