Which of the following algorithms is used to find the Minimum Spanning Tree…

2025

Which of the following algorithms is used to find the Minimum Spanning Tree (MST) of a graph ?

  1. A.

    Depth First Search (DFS)

  2. B.

    Dijkstra's Algorithm

  3. C.

    Kruskal's Algorithm

  4. D.

    Bellman-Ford Algorithm

Attempted by 104 students.

Show answer & explanation

Correct answer: C

Kruskal's Algorithm and Prim's Algorithm are used to find the Minimum Spanning Tree (MST) of a graph.

Explore the full course: Tpsc Assistant Technical Officer