Answer (Choose 1 answer)
(See picture)
A. {AC}, {D,F},{B,E}, {AD}, {
A,B},{F,G}
B. {A,C},{B,E}, {D,F},{A,D}, {A,B},{F,G}
C. (A,C},{B,E}, {D,F},{A,B}, {AD},{F,G}
D. (B,E}, {A,C},{D,F},{A,D}, {A,B},{F,G}
1
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
3
E17
