Question: Question 3 Consider the following directional network: B 0 D A E 6 3.1 Use the maximum-flow algorithm to determine the maximum number of units


Question 3 Consider the following directional network: B 0 D A E 6 3.1 Use the maximum-flow algorithm to determine the maximum number of units that can flow from node A to node F. Show all your workings on the network diagram. Tabulate each iteration showing the path and its associated flow. (4) 3.2 What is the maximum number of units that can flow from node A to node F? (1) 3.3 Draw the network diagram showing only the final flow along each arc. (4)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
