NETWORK MODEL – MAXIMAL FLOW

TECHNIQUE
BY: BAUTISTA, JESSA D.
PROBLEM #2:

Using the maximal flow technique, perform the

following:

1. Develop a network.
2. Prepare separate network for every iteration.
3. Determine the maximal flow of the special liquid in
the network.
NETWORK:

Inflow / 6 6
0 2 4 8
Destination
6
6
Outflow /
8 0 0 4
Source
10 2 10 2
1 5 7
16 4 2 0

6 8
0 12
3 6
2 2
 ITERATION 1:

Path: 1-2-4-7 Maximum Capacity: 6

06 612
60 2 4 28
6 6
6 0 2 4 8
66
28 00 0 410
8 4
10 2 10 2
1 5 7
1 7
16 44 2 0
Deduct the max. value Add the max. value to
66 to OUTFLOW INFLOW
8
0 3 6
12 8–6=2 0+6=6
2 2 6–6=0 6 + 6 = 12
8–6=2 4 + 6 = 10
 ITERATION 2:

Path: 1-2-5-7 Maximum Capacity: 2

0 12
68 2 4 22 6 2
66
46 6
02 20 00 10
10 2 0
10
10 22 8
10 24 10
1 5 77 2
1 5 7
16 44 2 00
Deduct the max. value Add the max. value to
66 to OUTFLOW INFLOW
88
0 12
12 2–2=0 6+2=8
3 6
2 2 6–2=4 0+2=2
10 – 2 = 8 2+2=4
 ITERATION 3:

Path: 1-5-7 Maximum Capacity: 8

0 12
8 2 4 2
6
4 10 2 8 4
10
1 5 7
0 2 0
210 102 08 124
1 5 7
16 4 2 0
Deduct the max. value Add the max. value to
to OUTFLOW INFLOW
6 8
10 – 8 = 2 2 + 8 = 10
0 12
3 6
2 2 8–8=0 4 + 8 = 12
ITERATION 4:

Path: 1-5-6-7 Maximum Capacity: 2

0 12 2 10
8 2 4 2
1 5 7
6
4 2 0

0 2 0 10
8
02 12
10 0 12 12
1 5 7 6

16 4 02 20 Deduct the max. value Add the max. value to

to OUTFLOW INFLOW
6 108 2–2=0 10 + 2 = 12
0 10
12
3 6 2–2=0 8 + 2 = 10
2 2
12 – 2 = 10 0+2=2
ITERATION 5:

Path: 1-3-6-7 Maximum Capacity: 2

0 12 1 7
8 2 4 2
6 16 2
4
0 2 0 10
0 3 6 10
0 12 0 12
1 5 7 2 2

16
14 4 0 2
4 Deduct the max. value Add the max. value to
to OUTFLOW INFLOW
6 10 16 – 2 = 14 0+2=2
20 10
8
3 6 2–2=0 2+2=4
02 2
4
10 – 2 = 8 2+2=4
COMPUTATION:

Iteration Path Capacity of Liquid

1 1-2-4-7 6
2 1-2-5-7 2
3 1-5-7 8
4 1-5-6-7 2
5 1-3-6-7 2

Therefore, the maximum flow of the special liquid is 20 (6+2+8+2+2).

THANK YOU