☑Kizspy.me
Given a weighted graph below and you are using the Dijkstra
(Choose 1 answer)
☐ A
algorithm to find the shortest path from the vertex A to the vertex
B. What are the correct order of vertices selected into the set S
until the vertex B is selected? (Each step a vertex with minimal
current distance is selected into S).
Back
Next
A. A, C, D, E, B
B. A, C, B
C. A, C, E, B
D. A, C, D, B
11
21
6
5
11
0
sh the exam.
LAPTOP RUNNING
