Nilda is the Engineering Consultant of Aboitiz Water Company and is tasked to ensure that

maximum amount of water flows from Water Pump A to Water Pump G. She was able to
determine the capacity of the outflow and inflow of water from one pump to another in liters per
second. The capacity figures are summarized in the Table.
 
What is the total capacity of water flow?
 
Final Exam: Computation Part 2 - 10 points
Step 1: Draw the Network

Capacity
Water Pump
(liters/second)

From To Out In
A B 5 9
A D 2 2
B C 4 1
B E 0 5
C D 9 6
C E 1 7
C F 7 4
D F 3 0
E G 8 8
F G 6 3

Step 2: Develop Iteration 1

Path 1: A-D-F-G
1. Identify a complete network from
Start to End with no outflow equal to
zero.
A to D = 2
D to F = 3
F to G = 6
2. Compute the minimum outflow.
2 = minimum (2,3,6)
3. Subtract the minimum outflow from
all outflows in the network.
A to D = 2 - 2 = 0
D to F = 3 - 2 = 1
F to G = 6 – 2 = 4
4. Add the minimum outflow to all
inflows in the network.
A to D = 2 + 2 = 4
D to F = 0 + 2 = 2
F to G = 3 + 2 = 5
Step 3: Develop Iteration 2
Step 4: Develop Iteration 3
Path 2: A-B-C-E-G
1. Identify a complete network from
Start to End with no outflow equal to
zero.
A to B = 5
B to C = 4
C to E = 1
E to G = 8
2. Compute the minimum outflow.
1 = minimum (5,4,1,8)
3. Subtract the minimum outflow from
all outflows in the network.
A to B = 5 – 1 = 4
B to C = 4 – 1 = 3
C to E = 1 – 1 = 0
E to G = 8 – 1 = 7
4. Add the minimum outflow to all
inflows in the network.
A to B = 9 + 1 = 10
B to C = 1 + 1 = 2
C to E = 7 + 1 = 8
E to G = 8 + 1 = 9
Path 3: A-B-C-D-F-G
1. Identify a complete network from
Start to End with no outflow equal to
zero.
A to B = 4
B to C = 3
C to D = 9
D to F = 1
F to G = 4
2. Compute the minimum outflow.
1 = minimum (4,3,9,1,4)
3. Subtract the minimum outflow from
all outflows in the network.
A to B = 4 – 1 = 3
B to C = 3 – 1 = 2
C to D = 9 – 1 = 8
D to F = 1 – 1 = 0
F to G = 4 – 1 = 3
4. Add the minimum outflow to all
inflows in the network.
A to B = 10 + 1 = 11
B to C = 2 + 1 = 3
C to D = 6 + 1 = 7
D to F = 2 + 1 = 3
F to G = 2 + 1 = 3
Step 5: Develop Iteration 4
Path 4: A-B-C-F-G
1. Identify a complete network from
Start to End with no outflow equal to
zero.
A to B = 3
B to C = 2
C to F = 7
F to G = 3
2. Compute the minimum outflow.
2 = minimum (3,2,7,3)
3. Subtract the minimum outflow from
all outflows in the network.
A to B = 3 – 2 = 1
B to C = 2 – 2 = 0
C to F = 7 – 2 = 5
F to G = 3 – 2 = 1
4. Add the minimum outflow to all
inflows in the network.
A to B = 11 + 2 = 13
B to C = 3 + 2 = 5
C to F = 4 + 2 = 6
F to G = 3 + 2 = 5
Step 6: Determine the total capacity

WATER PUMP CAPACITY

PATH
(NODES) (L/s)
1 A-D-F-G 2
2 A-B-C-E-G 1
3 A-B-C-D-F-G 1
4 A-B-C-F-G 2
TOTAL CAPACITY (L/s) 6

6 litter per second is the total

capacity of water flow of the water
pump in pump A to pump G.