Professional Documents
Culture Documents
DS Sesion 12 Shortest Route Problem
DS Sesion 12 Shortest Route Problem
1 2 7 1 1 1= 1
1 3 9 0 2 0= 0
1 4 18 0 3 0= 0
2 3 3 0 4 0= 0
2 5 5 1 5 0= 0
3 2 3 0 6 0= 0
3 5 4 0 7 1= 1
4 6 3 0
5 2 5 0
5 3 4 0
5 6 2 1
5 7 6 0
6 5 2 0
6 7 3 1
Total Distance 17
MATRIX METHOD
1 2 3 4 5 6 7
7 9 18
3 5
3 4
3
5 4 2 6
2 3
1 2 3 4 5 6 7
Supply/Demand
Sources Capacity Destination Demand Road Agrabad City Gate Tejgaon
Rangamati 30 Agrabad 15 Rangamati 25 22 37
Bandarban 15 City Gate 12 Bandarban 36 26 41
Khagrachhari 5 Tejgaon 35 Khagrachhari 18 32 50
Bagerhat 20 Tongi 12 Bagerhat 53 48 28
Khulna 8 BSCIC 8 Khulna 49 46 17
Hobigonj 12 Kadamtoli 13 Hobigonj 62 58 55
Moulovibazar 10 Rangpur 5 Moulovibazar 57 63 48