GATE | GATE CS 1996 | Question 64

A complete, undirected, weighted graph G is given on the vertex {0, 1,…., n−1} for any fixed ‘n’. Draw the minimum spanning tree of G if

a) the weight of the edge (u,v) is ∣ u−v
b) the weight of the edge (u,v) is u + v



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

My Personal Notes arrow_drop_up

Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.