42
dist² [5] = min {dist¹ [5], min {dist¹ [i] + cost [i,5]}}
=
min {100, 0+100, 10+~, ~+10, 30+50} = 80
Tabel 2.4 Iterasi Algoritma Bellman Ford Untuk k = 2
k
dist k [1…5]
1
2
3
4
5
1
0
10
~
30
100
2
0
10
50
30
80
3
~
~
~
~
~
4
~
~
~
~
~
k = 3
untuk
i
=
2, 3, 4, 5 dan u = 1
dist³ [1] = min {dist² [1], min {dist² [i] + cost [i,1]}}
=
min {0, 10+~, 50+~, 30+~, 80+~} = 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, 50+~, 30+~, 80+~} = 10
untuk
i
=
1, 2, 4, 5 dan u = 3
dist³ [3] = min {dist² [3], min {dist² [i] + cost [i,3]}}
=
min {50, 0+~, 10+50, 30+20, 80+~} = 50
 |