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