Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Graphs/Spanning Tree and Shortest Paths Spanning Tree
An undirected graph G (V, E) contains n (n > 2) nodes named ν1, ν2, ....νn. Two nodes νi, and νj are connected if and only if 0 < |i - j| ≤ 2. Each edge (νi, νj) is assigned a weight i + j.
The cost of the minimum spanning tree of such a graph with 10 nodes is :
1
88
2
91
3
49
4
21