Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Graphs/Spanning Tree and Shortest Paths Spanning Tree
Consider the graph given below:
Use Kruskal’s algorithm to find a minimal spanning tree for the graph. The List of the edges of the tree in the order in which they are chosen is?
1
AD, AE, AG, GC, GB, BF
2
GC, GB, BF, GA, AD, AE
3
GC, AD, GB, GA, BF, AE
4
AD, AG, GC, AE, GB, BF