NIM : 130403124
Nama : R.Aldi Yaqobi
Kelas :B
Penyelesaian:
Network ditransformasi ke dalam representasi incident matrix seperti pada Tabel
dibawah ini
1 2 3 4
1 0 4 5 10
E= 2 6 0 9
3 4 10 0 4
4 12 5 0
Elemen-elemen matrik D1
Elemen-elemen Matrik Path yang bersesuaian
d111 = Min {(0+0),0)} = 0
d121 = Min {(0+4),4)} = 4 (1,2)
d131 = Min {(0+5),5)} = 5 (1,3)
d141 = Min {(0+10),10)} = 10 (1,4)
d211 = Min {(6+0),6)} = 6 (2,1)
d221 = 0
d231 = Min {(6+5),9)} = 9 (2,3)
d241 = Min {(6+10),)} = 16 (2,1), (1,4)
d311 = Min {(4+0),4)} = 4 (3,1)
d321 = Min {(4+4),10)} =8 (3,1), (1,2)
d331 = 0
d341 = Min {(4+10),4)} = 4 (3,4)
d411 = Min {(12+0),12)} = 12 (4,1)
d421 = Min {(12+4), )} = 16 (4,1), (1,2)
d431 = Min {(12+5),5)} = 5 (4,3)
d441 = 0
Jarak terpendek menurut Matrik D1 dapat dilihat pada Tabel di bawah ini
1 2 3 4
1 0 4 5 10
D1 = 2 6 0 9 16
3 4 8 0 4
4 12 16 5 0
Lintasan terpendek antar node dengan 1 node antara pada Matrik D1 dapat dilihat
pada Tabel di bawah ini
1 2 3 4
1 x (1,2) (1,3) (1,4)
2 (2,1) x (2,3) (2,1), (1,4)
3 (3,1) (3,1), (1,2) x (3,4)
4 (4,1) (4,1), (1,2) (4,3) x
Elemen-elemen matrik D2
Elemen-elemen Matrik Path yang bersesuaian
2
d11 = Min {(4+6),0)} = 0
2
d12 = Min {(4+0),4)} = 4 (1,2)
2
d13 = Min {(4+9),5)} = 5 (1,3)
2
d14 = Min {(4+16),10)} = 10 (1,4)
1
d21 = Min {(0+6),6} = 6 (2,1)
1
d22 =0
1
d23 = Min {(0+9),9)} = 9 (2,3)
1
d24 = Min {(0+16),16)} = 16 (2,1), (1,4)
d311 = Min {(8+6),4)} = 4 (3,1)
d321 = Min {(8+0),8)} = 8 (3,1), (1,2)
d331 = 0
d341 = Min {(8+16),4)} = 4 (3,4)
d411 = Min {(16+6),12)} = 12 (4,1)
d421 = Min {(16+0),16)} = 16 (4,1), (1,2)
d431 = Min {(16+9),5)} = 5 (4,3)
d441 = 0
Jarak terpendek menurut Matrik D2 dapat dilihat pada Tabel di bawah ini
1 2 3 4
1 0 4 5 10
D2 = 2 6 0 9 16
3 4 8 0 4
4 12 16 5 0
Lintasan terpendek antar node dengan 2 node antara pada Matrik D2 dapat dilihat
pada Tabel di bawah ini
1 2 3 4
1 x (1,2) (1,3) (1,4)
2 (2,1) x (2,3) (2,1), (1,4)
3 (3,1) (3,1), (1,2) x (3,4)
4 (4,1) (4,1), (1,2) (4,3) x
Elemen-elemen Matrik D3
Elemen-elemen Matrik Path yang bersesuaian
d113 = Min {(5+4),0)} = 0
d123 = Min {(5+8),4)} = 4 (1,2)
d133 = Min {(5+0),5)} = 5 (1,3)
d143 = Min {(5+4),10)} = 9 (1,3), (3,4)
d213 = Min {(9+4),6)} = 6 (2,1)
d223 = 0
d233 = Min {(9+0),9)} = 9 (2,3)
d243 = Min {(9+4),16)} = 13 (2,3), (3,4)
d313 = Min {(0+4),4)} = 4 (3,1)
d323 = Min {(0+8),8)} = 8 (3,1), (1,2)
d333 = 0
d343 = Min {(0+4),4)} = 4 (3,4)
d413 = Min {(5+4),12)} = 9 (4,3), (3,1)
d423 = Min {(5+8),16)} = 13 (4,3), (3,1), (1,2)
d433 = Min {(5+0),5)} = 5 (4,3)
d443 = 0
Jarak terpendek menurut Matrik D3 dapat dilihat pada Tabel di bawah ini
1 2 3 4
1 0 4 5 9
D3 = 2 6 0 9 13
3 4 8 0 4
4 9 13 5 0
Lintasan terpendek antar node dengan 3 node antara pada Matrik D3 dapat dilihat
pada Tabel di bawah ini
1 2 3 4
1 x (1,2) (1,3) (1,3), (3,4)
2 (2,1) x (2,3) (2,3), (3,4)
3 (3,1) (3,1), (1,2) x (3,4)
4 (4,3), (3,1) (4,3), (3,1), (1,2) (4,3) x
Elemen-elemen Matrik D4
Elemen-elemen Matrik Path yang bersesuaian
4
d11 = Min {(9+9),0)} = 0
4
d12 = Min {(9+13),4)} = 4 (1,2)
4
d13 = Min {(9+5),5)} = 5 (1,3)
4
d14 = Min {(9+0),9)} = 9 (1,3), (3,4)
4
d21 = Min {(13+9),6)} = 6 (2,1)
4
d22 =0
4
d23 = Min {(13+5),9)} = 9 (2,3)
4
d24 = Min {(13+0),13)} = 13 (2,3), (3,4)
4
d31 = Min {(4+9),4)} = 4 (3,1)
4
d32 = Min {(4+13),8)} = 8 (3,1), (1,2)
4
d33 =0
4
d34 = Min {(4+0),4)} = 4 (3,4)
4
d41 = Min {(0+9),9)} = 9 (4,3), (3,1)
4
d42 = Min {(0+13),13)} = 13 (4,3), (3,1), (1,2)
4
d43 = Min {(0+5),5)} = 5 (4,3)
4
d44 =0
Jarak terpendek menurut Matrik D4 dapat dilihat pada Tabel di bawah ini
1 2 3 4
1 0 4 5 9
4
D = 2 6 0 9 13
3 4 8 0 4
4 9 13 5 0
Lintasan terpendek antar node dengan 4 node antara pada Matrik D3 dapat dilihat
pada Tabel di bawah ini
1 2 3 4
1 x (1,2) (1,3) (1,3), (3,4)
2 (2,1) x (2,3) (2,3), (3,4)
3 (3,1) (3,1), (1,2) x (3,4)
4 (4,3), (3,1) (4,3), (3,1), (1,2) (4,3) x
Dari tabel diatas didapatkan mimimum spanning tree adalah (1,4) (2,3) (2,4)
(4,8) (5,8) (4,6) (4,7) (7,9) dengan total bobot 40.