Kizspy | Question: 87
(Choose 1 answer)
(See picture)
A. {A,C},{B,E}, {D,F},{A,D},{A,B},{F,G}
B. {B,E},{A,C},{D,F},{A,D},{A,B},{F,G}
C. {A,C},{B,E}, {D,F},{A,B},{A,D},{F,G}
D. {A,C},{D,F},{B,E},{A,D},{A,B},{F,G}
Use Kruskal's algorithm to find a minimum spanning tree for the weighted graph with the first edge being {A, C}. Assume that the vertices are ordered alphabetically.
2
1
F
1
2
2
2
2
3
G
1
3
