Which algorithm finds the Minimum Spanning Tree by selecting edges in…
2025
Which algorithm finds the Minimum Spanning Tree by selecting edges in increasing order of weight?
Answer: C. Kruskal's Algorithm — Correct answer: Kruskal's Algorithm. Kruskal's Algorithm sorts all edges by weight and adds the smallest edge that does not create a cycle. This…
- A.
Prim's Algorithm
- B.
Dijkstra's Algorithm
- C.
Kruskal's Algorithm
- D.
Floyd-Warshall Algorithm
- E.
Bellman-Ford Algorithm
Attempted by 505 students.
Show answer & explanation
Correct answer: C
Correct answer: Kruskal's Algorithm.
Kruskal's Algorithm sorts all edges by weight and adds the smallest edge that does not create a cycle. This edge-selection method builds the MST for a connected weighted graph.
Loading lesson…