BANK SEBI Grade A Phase 1 & Phase 2 Mock Test 2024 Algorithms Graphs/Spanning Tree and Shortest Paths Spanning Tree
A weighted complete graph with n vertices has weight 2|i - j| at edges (vi, vj). The weight of a minimum spanning tree is
1
\(\frac{{{n^2}}}{2}\)
2
\(\frac{n}{2}\)
3
2n - 2
4
n - 2
5
n - 1