Kizspy | Question: 99
(Choose 1 answer)
(See picture)
A. {C,E}, {C,G},{A,B},{A,D},{F,E},{D,G}
B. {A,B},{A,D},{G,C},{C,E}, {D,G},{C,F}
C. {C,G},{A,D},{A,B},{C,E},{B,G},{C,F}D. {A,B},{A,D},{G,C},{C,E},{D,E},{C,F}
Consider the following weighted graph
1
1
3
2
G
3
2
1
2
3
1
2
2
F
Which one of the following is NOT the sequence of edges added to the minimum spanning tree using Kruskal's algorithm?
