An all-pairs shortest-paths problem is efficiently solved using :

UGC NET 2015

An all-pairs shortest-paths problem is efficiently solved using :

  1. A.

    Dijkstra's algorithm

  2. B.

    Bellman-Ford algorithm

  3. C.

    Kruskal algorithm

  4. D.

    Floyd-Warshall algorithm

Attempted by 787 students.

Sign up free to check your answer

Sign up free

Explore the full course: Uppsc Polytechnic Lecturer 2025 Cs

Loading lesson…