Q38

MCQ2 marks, −0.67

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?

(A)

$\text{(b, e) (e, f) (a, c) (b, c) (f, g) (c, d)}$

(B)

$\text{(b, e) (e, f) (a, c) (f, g) (b, c) (c, d)}$

(C)

$\text{(b, e) (a, c) (e, f) (b, c) (f, g) (c, d)}$

(D)

$\text{(b, e) (e, f) (b, c) (a, c) (f, g) (c, d)}$

Loading…