Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Graphs/Spanning Tree and Shortest Paths Graph Search
Consider the following graph.
Assume node ‘S’ as the starting vertex for Prim’s algorithm. Which of the following can be the correct order of edges in which they are added to construct MST?
1
1,2,4,5,6,8,9
2
1,2,5,6,9,8
3
1,2,5,6,8,9
4
None of the above