☑Kizspy.me
(Choose 1 answer)
8888
Next
Given a weighted graph below
and you are using the Dijkstra
algorithm to find the shortest
path from the vertex B to the
vertex F. What are the correct
order of vertices selected into
the set S until the vertex F is
selected? (Each step a vertex
with minimal current distance is
selected into S).
A. B, C, E, F
B. B, C, D, E, F
4
22
8
9
12
14
12
Back
C. B. C. F
D. B. C. D. F
FUO.sh
sh the exam.
