For the undirected, weighted graph given below, which of the following…

PYQ GATE 2008

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 Spanning Tree?

1. A.

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

2. B.

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

3. C.

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

4. D.

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

Attempted by 331 students.