engineering recuitment GATE CSE 2023-24 Test Series Algorithms Graphs/Spanning Tree and Shortest Paths Spanning Tree
Let G be a connected undirected graph of 100 vertices and 300 edges.The weight of a minimum spanning tree of G is 600.when the weight of each edge of G is increased by six,The weight of a minimum spanning tree becomes -
Enter numerical value using the virtual keypad. Round off where necessary.