edited by
3,260 views

1 Answer

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  

Answer:

Related questions

4 votes
4 votes
3 answers
3