Kizspy | Question: 50
(Choose 1 answer)
(See picture)
A. ED
B. EC
C. CF
D. EF
E. None of the other choices is correct
If using the Prim's algorithm to find a minimum spanning tree T from the graph below, which edge is added to T in the last step?
1
2
4
5
F
4
7
