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?

  1. A.

    Prim’s algorithm

  2. B.

    Dijikstra’s algorithm

  3. C.

    Bellman-Ford’s algorithm

  4. D.

    Floyd-Warshall’s algorithm

Attempted by 1023 students.

Show answer

Correct answer: D

The worked solution is available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…