Network Flow Problems

Max-Flow Algorithm. Also called

as Augmented Flow Algorithm
or Ford-Fulkerson Algorithm

1
 Some of the applications

System of roads and highways

Maximize rate of flow of vehicles

System of pipelines that carries oil,

natural gas and water
Maximize the rate of flow of fluids

Telecommunication network
Routing data – best of use bandwidth 2
 Frequently Used Algorithm

Maximal Flow Algorithm

Used for determining the greatest amount of flow that can be

transmitted through a system in which various branches, or
connections, have specified flow capacity limitations.

The algorithm to find maximum flow in a network is called

Max-Flow Algorithm or Augmented Flow Algorithm
or Ford-Fulkerson Algorithm

3
 Maximal Flow Algorithm

• Before terminating, the network should also be scanned for reverse flow
augmenting paths and should be updated accordingly
4
Example 1

flow
capacity A
3
5 T
1 9
7 4 D
O B

2 1 6
4 5
Source Sink
node C node
E
4

A, B, C, D, E >>> these nodes are called transhipment nodes

5
 Residual network

A 3
0 1
0 T
5 0
0 9 0
7 0 D
O B 4 0
4 2 5 0

0
0 0 1
C 6
4 E
residual 0
capacity
current
flow value 6
 0
4 A 3
3
0 1 8
0 7
1 4
3
2
1 3 5 0 T
2 0 6
0
5 1 0 9
6 1 4 1
4 3
7 3 4 3 0 4 0
D
0
O B 4
6
2 0
5
4 1
0 4
2

0 0
0 1
3
4 1 0
C 6 0
2
4 E
0 0
4
Flow Augmenting Path Flow

O-A-D-T 3

O-A-B-D-T 1

O-B-D-T 3

O-C-E-T 4 Total flow through the network = 14

O-B-E-D-T 1 7

O-B-E-T 2
 0
4 A 3
3
0 1 8
0 7
1 4
3
2
1 3 5 0 T
2 0 6
0
5 1 0 9
6 1 4 1
4 3
7 3 4 3 0 4 0
D
0
O B 4
6
2 0
5
4 1
0 4
2

0 0
0 1
3
4 1 0
C 6 0
2
4 E
0 0
4
Flow Augmenting Path Flow

O-A-D-T 3

O-A-B-D-T 1

O-B-D-T 3

O-C-E-T 4 Total flow through the network = 14

O-B-E-D-T 1 8

O-B-E-T 2
9
Example 2 - Exercise

10
2 5
30
40 10 20

1 4
10 7
40
10
15
20
3 6
20

10
11
No reverse flow
augmenting paths.

12
Total flow = 55
Backup

13