41
Tabel 2.3 Iterasi Algoritma Bellman Ford Untuk k = 1
k
dist k [1…5]
1
2
3
4
5
1
0
10
~
30
100
2
~
~
~
~
~
3
~
~
~
~
~
4
~
~
~
~
~
k = 2
untuk i = 2, 3, 4, 5 dan u = 1
dist² [1] = min {dist¹ [1], min {dist¹ [i] + cost [i][1]}}
=
min {0, 10 + ~, ~ + ~, 30 + ~, 100 + ~} = 0
untuk i = 1, 3, 4, 5 dan u = 2
dist² [2] = min {dist¹ [2], min {dist¹ [i] + cost [i,2]}}
=
min {10, 0+10, ~+~, 30+~, 100+~} = 10
untuk i = 1, 2, 4, 5 dan u = 3
dist² [3] = min {dist¹ [3], min {dist¹ [i] + cost [i,3]}}
=
min {~, 0+~, 10+50, 30+20, 100+~} = 50
untuk i = 1, 2, 3, 5 dan u = 4
dist² [4] = min {dist¹ [4], min {dist¹ [i] + cost [i,4]}}
=
min {30, 0+30, 10+~, ~+~, 100+~} = 30
untuk
i
=
1, 2, 3, 4 dan u = 5
 |