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?
$\text{(b, e) (e, f) (a, c) (b, c) (f, g) (c, d)}$
$\text{(b, e) (e, f) (a, c) (f, g) (b, c) (c, d)}$
$\text{(b, e) (a, c) (e, f) (b, c) (f, g) (c, d)}$
$\text{(b, e) (e, f) (b, c) (a, c) (f, g) (c, d)}$
In Option D $\text{ b-c}$ with weight, $4$ is added before $\text{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.
@Sankaranarayanan P.N
> So option D may be correct
D is one of the correct option.
option d is right
Only sequence in option d is not possible..
64.3k questions
77.9k answers
243k comments
79.6k users