BANK SEBI Grade A Phase 1 & Phase 2 Mock Test 2024 Algorithms Graphs/Spanning Tree and Shortest Paths Spanning Tree
The weight of minimum spanning tree in graph G, calculated using Kruskal’s algorithm is:
1
14
2
15
3
17
4
18
5
13
The weight of minimum spanning tree in graph G, calculated using Kruskal’s algorithm is: