Multiple choices 3/50
Answer (Choose 1 answer)
(See picture)
A. AD
B. BD
C. EC
D. EF
Next
E. None of the other choices is correct
If using the Kruskal's algorithm to find a minimum spanning tree T from the graph below, which edge is added to T in the last step?
1
6
3
1
5
5
2
F
1
4
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
