☑Kizspy.me
Given Document
(Choose 1 answer)
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?
☐ A
(See picture)
A. AD
B. EF
C. EC
D. BD
Back
Next
E. None of the other
choices is correct
1
6
3
1
5
5
2
F
1
4
☐
sh the exam.
LAPTOP RUNNING
