☑Kizspy.me
ple Choices 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 Tin the last step?
☐ A
(See picture)
☐ B
A. BD
ос
B. AD
1
6
☐ D
C. EF
☐ E
3
D. EC
5
5
2
E. None of the other choices is correct
F
Back
Next
1
4
I want to in the exam.
LAPTOP RUNNING
