GATE | Gate IT 2008 | Question 43

For the undirected, weighted graph given below, which of the following sequences of edges represents a correct execution of Prim\’s algorithm to construct a Minimum Span­ning Tree?

(A)

(a, b), (d, f), (f, c), (g, i), (d, a), (g, h), (c, e), (f, h)

(B)

(c, e), (c, f), (f, d), (d, a), (a, b), (g, h), (h, f), (g, i)

(C)

(d, f), (f, c), (d, a), (a, b), (c, e), (f, h), (g, h), (g, i)

(D)

(h, g), (g, i), (h, f), (f, c), (f, d), (d, a), (a, b), (c, e)

Answer: (C)

Explanation:

In prims algorithm we start with any node and keep on exploring minimum cost neighbors of nodes already covered.

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Save