Given a weighted graph below and you are using the Dijkstra algorithm to find the shortest path from the vertex A 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).
6
Multiple choices 6/50
Answer (Choose 1 answer)
A. A, B, C, E, F
B. A, C, D, F
C. A, C, E, F
Next
D. A, B, C, E, D, F
11
F
6
2
14
6
9
10
15
7
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45 46
47
48
49
50
