Computer Sciences > Gate 2020 > Minimum Spinning Tree
Consider a graph G=(V, E), where V = { v1,v2,…,v100 }, E={ (vi, vj) ∣ 1<=i<j<=100 is ∣ i–j ∣ . The weight of minimum spanning tree of G is ________ .
Correct : 99
Total Unique Visitors
Loading......