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