Which algorithm finds the Minimum Spanning Tree by selecting edges in…
PYQ IBPS SO CRP SPL-XV (2025)
Which algorithm finds the Minimum Spanning Tree by selecting edges in increasing order of weight?
- A.
Prim’s Algorithm
- B.
Dijkstra’s Algorithm
- C.
Kruskal’s Algorithm
- D.
Floyd-Warshall Algorithm
- E.
Bellman-Ford Algorithm
Attempted by 72 students.
Sign up free to check your answer
Sign up freeLoading lesson…

