engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Graphs/Spanning Tree and Shortest Paths Spanning Tree
Let G be a connected undirected graph of 100 vertices and 600 edges. The weight of a minimum spanning tree of G is 1000. When the weight of each edge of G is increased by five, the weight of a minimum spanning tree becomes _______.
1
1495
2
2000
3
1500
4
1995