3: Maximum Flow and Minimum Cut Problem
During peak traffic hours, many
cars are travelling from a downtown parkade to the nearest freeway on
ramp. The traffic engineers have decided to widen the road
downtown to accomodate this heavy flow of cars traveling between these
two points. Which roads should the engineers widen in order
to achieve this goal?
Below is a network that shows the roads connecting the parkade, node A,
to the freeway on-ramp, node G. The arcs are labeled with
their directional flow.
||This shows that A to B has a capacity of 5, while B to
A has a capacity of 0.
Press the Start button to begin the example and find out
which roads should be widened.
This animation was made using Alligator Flash Designer 7.
More information about this program is available at
You can view the source code for this animation using the trial verson
of Alligator Flash Designer 7 and this