Skip to content
Related Articles

Related Articles

GATE | Gate IT 2008 | Question 43

Improve Article
Save Article
Like Article
  • Difficulty Level : Expert
  • Last Updated : 28 Jun, 2021

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?
2008_45
(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

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!