(Latest Revision:
Apr 19, 2020)
Flow Network Problem
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 are links to my screencast and the powerpoint demo:
Directions For Submitting Solution:
Send your solution to
tester2@cs.csustan.edu
with this subject line:
CS 4440 Network Flow Problem
(Copy & Paste that exact subject line. Get it right, or get no credit.)
Put page numbers on the pages, and attach scans or photos of them (small, low resolution files, please) . (Let me know if sending the images is a problem for you.)