Consider the following graph:
Which one of the following cannot be the sequence of edges added, in that order, to a minimum spanning tree using Kruskal’s algorithm?
In Kruskal's algo the edges are added in non decreasing order of their weight. But in Option D edge $d-e$ with weight $3$ is added before edge $d-c$ with weight $2$. Hence, option D is wrong option.
Correct Answer: $D$
(d - f) = 1
(a - b) = 1
(b - f) = 2
(d - e) = 3
(d - c) = 2
In kruskal's algo the edges are added in non decreasing order of their weight. but (d - e) added before (d - c)
In all the possible ways, edge d-e is added at the end.. So option d is wrong..