Which of the following algorithm solves the all-pair shortest path problem?
ISRO Scientist/Engineer SC · May 2017 · Computer Science
Which of the following algorithm solves the all-pair shortest path problem?
- A.
Prim’s algorithm
- B.
Dijikstra’s algorithm
- C.
Bellman-Ford’s algorithm
- D.
Floyd-Warshall’s algorithm
Attempted by 1023 students.
Show answer
Correct answer: D
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…