Algorithms
October 12, 2023Algorithms
October 12, 2023Algorithms
Question 32 |
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
Theory Explanation. |
Correct Answer: A
Subscribe
Login
0 Comments