63
Exercise #8: Dijkstra's Algorithm
Show how Dijkstra's algorithm runs on (source node = 0):
[0]
[1]
[2]
[3]
[4]
[5]
dist
0
∞
∞
∞
∞
∞
pred
–
–
–
–
–
–