GATE | Sudo GATE 2020 Mock I (27 December 2019) | Question 64

Compute minimum spanning tree for the following undirected, weighted graph, using Prim’s algorithm


The weight and number of spanning tree(s) are _____________ .
(A) 38 and 2 respectively.
(B) 34 and 1 respectively.
(C) 34 and 2 respectively.
(D) None of these.


Answer: (B)

Explanation: Minimum spanning tree for given graph:

So, the weight and number of spanning tree(s) are 34 and 1 respectively.

Option (B) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.