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


Answer:

Explanation:

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