Consider the following graph:
Which one of the following is NOT the sequence of edges added to the minimum spanning tree using Kruskal’s algorithm?
(b, e) (e, f) (a, c) (b, c) (f, g) (c, d)
(b, e) (e, f) (a, c) (f, g) (b, c) (c, d)
(b, e) (a, c) (e, f) (b, c) (f, g) (c, d)
(b, e) (e, f) (b, c) (a, c) (f, g) (c, d)
In Kruskal's algorithm, Edges are sorted in ascending order in O(ElogE) time. Any edge with larger weight can't be added before an edge with the smaller weight.
(D) is the correct choice, b-c can't added before a-c.
@Manu Thakur Sir pls help.. i dont understand y m i stuck with the answer of this simple problem !!!
in option d b-c with weight $4$ is added before a-c with weight $3$ is added. In kruskal's algorithm edges should be added in non decreasing order of weight
So option D may be correct
> So option D may be correct
D is one of the correct option.