Exam-style question
Try this first
In a trace of Dijkstra’s algorithm starting at vertex A, the current tentative distances are B = 4, C = 1 and D = infinity. Which vertex should be selected next?.
- A.A
- B.B
- C.C
- D.D
Model answer
What a good answer should say
- C
Explanation
Why this works
The unvisited vertex with the smallest tentative distance is C, with a distance of 1.
Common mistake
No common mistake is linked to this question yet.