InterviewSolution
Saved Bookmarks
| 1. |
An all-pairs shortest-paths problem is efficiently solved using:(A) Dijkstra’ algorithm(B) Bellman-Ford algorithm(C) Kruskal algorithm(D) Floyd-Warshall algorithm |
| Answer» | |