engineering recuitment GATE CSE 2023-24 Test Series Algorithms Graphs/Spanning Tree and Shortest Paths Spanning Tree
A complete graph G with 5 nodes has positive weight edges, each node has a distinct weight with an integer value and maximum weight is equal to number of edges in G.
What can be the maximum weight of minimum spanning tree for graph G?Enter numerical value using the virtual keypad. Round off where necessary.