engineering recuitment ISRO Scientist Computer Science Mock Test Algorithms Graphs/Spanning Tree and Shortest Paths Spanning Tree
In which order the edges of the given graph are chosen while constructing the minimum spanning tree using prim’s algorithm?
1
(1, 6) (6, 5), (5, 4), (4, 3), (3, 2), (2, 7)
2
(1, 6), (3, 4), (2, 7), (2, 3), (7, 4), (5, 4)
3
(1, 6), (3, 4), (2, 7), (4, 5), (1, 2), (5, 6)
4
(1, 6), (6, 5), (5, 4), (4, 3), (3, 2), (4, 7)