Which algorithm is used for finding the shortest path between nodes in a graph…

2025

Which algorithm is used for finding the shortest path between nodes in a graph with weighted edges ?

  1. A.

    Depth First Search (DFS)

  2. B.

    Breadth First Search (BFS)

  3. C.

    Dijkstra's Algorithm

  4. D.

    Kruskal's Algorithm

Attempted by 71 students.

Show answer & explanation

Correct answer: C

Dijkstra's Algorithm is used for finding the shortest path between nodes in a graph with weighted edges.

Explore the full course: Tpsc Assistant Technical Officer