GATE 2009 CS – Question 38
For the graph shown, which is NOT a possible sequence of edges added by Kruskal’s minimum-spanning-tree algorithm?

Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: (D) (b, e), (e, f), (b, c), (a, c), (f, g), (c, d)
Explanation
We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort
More Graph Algorithms: Traversals, Minimum Spanning Trees, Shortest Paths questions
All Graph Algorithms: Traversals, Minimum Spanning Trees, Shortest Paths questions →