Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra is a graph search algorithm that solves the single-source shortest path problem for a connected graph with nonnegative edge path costs, producing a shortest path tree


The Floyd-Warshall algorithm is an O(|V|^3) algorithm for computing all-pairs shortest paths in a directed weighted graph.


Quality Example

"No practically floyd-warshall is faster than dijkstra s for all pair shortest path generally"

from question "Dijkstra vs. Floyd-Warshall: Finding optimal route on all node pairs"

More efficient

"Short answer floyd-warshall is more efficient in this case than naive application of dijkstra s"

from question "Python: Determine whether each step in path across n arrays falls below threshold value"


"Indeed floyd-warshall s algorithm is better than dijkstra s in this case the complexity for dijkstra is o m n 2 and in this problem m is much much higher than n so the o n 3 time complexity of floyd-warshall is better"

from question "How to improve Dijkstra algorithm when querying n times?"

Back to Home
Data comes from Stack Exchange with CC-BY-SA-3.0