Multiple choices 26/50
Apply the Dijkstra algorithm to find the shortest path from A to Z. What are the first 4 vertices chosen?
Answer (Choose 1 answer)
A. a, d, b, c
B. a, b, d, c
C. a, d, e, z
D. a, b, c, z
Next
E. None of the other choices is correct
6
3
5
1
1
2
2
2
5
2
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
