☑Kizspy.me
☐ A
☐ D
(Choose 1 answer)
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. D. F
B. B. C. F
Back
Next
C. B, C, D, E, F
D. B. C. E. F
FUO.sh
sh the exam.
22
8
6
12
12
2
