3 votes 3 votes An all-pairs shortest-paths problem is efficiently solved using: Dijkstra's algorithm Bellman-Ford algorithm Kruskal algorithm Floyd-Warshall algorithm Algorithms ugcnetcse-june2015-paper3 algorithms easy shortest-path + – go_editor asked Jul 31, 2016 edited Jan 10 by Hira Thakur go_editor 3.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes An all-pairs shortest-paths problem is efficiently solved using Floyd-Warshall algorithm with time complexity O(n3) using dynamic programming. D is ans Prashant. answered Jul 31, 2016 Prashant. comment Share Follow See all 0 reply Please log in or register to add a comment.