Which of the following algorithms is used to find the shortest path in a graph…
2025
Which of the following algorithms is used to find the shortest path in a graph between a source vertex and all other vertices?
Answer: A. Dijkstra's Algorithm — Dijkstra's Algorithm is used to find the shortest path in a graph from a source vertex to all other vertices.
- A.
Dijkstra's Algorithm
- B.
Kruskal's Algorithm
- C.
Prim's Algorithm
- D.
None of the above
Attempted by 310 students.
Show answer & explanation
Correct answer: A
Dijkstra's Algorithm is used to find the shortest path in a graph from a source vertex to all other vertices.
Loading lesson…