44
untuk
i
=
1, 2, 4, 5 dan u = 3
dist
4
[3] = min {dist³ [3], min {dist³ [i] + cost [i,3]}}
=
min {50, 0+~, 10+50, 30+20, 60+~} = 50
untuk
i
=
1, 2, 3, 5 dan u = 4
dist
4
[4] = min {dist³ [4], min {dist³ [i] + cost [i,4]}}
=
min {30, 0+30, 10+~, 50+~, 60+~} = 30
untuk
i
=
1, 2, 3, 4 dan u = 5
dist
4
[5] = min {dist³ [5], min {dist³ [i] + cost [i,5]}}
=
min {60, 0+100, 10+~, 50+10, 30+50} = 60
Tabel 2.6 Iterasi Algoritma Bellman Ford Untuk k = 4
k
dist k [1…5]
1
2
3
4
5
1
0
10
~
30
100
2
0
10
50
30
80
3
0
10
50
30
60
4
0
10
50
30
60
Proses pencarian selesai dengan hasil shortest path sebesar 60.
 |