Algorithmshard

What does the Floyd–Warshall algorithm compute and what is its complexity?

Answer

Floyd–Warshall computes shortest paths between all pairs of vertices. It runs in O(V^3) time and uses O(V^2) memory, so it’s practical mainly for smaller or dense graphs. It can handle negative edges, but not negative cycles.

Related questions

Algorithms

A* search: how does the heuristic affect optimality?

#a-star#heuristic#shortest-path

Algorithms

Bellman–Ford: when do you use it and what extra capability does it have over Dijkstra?

#bellman-ford#shortest-path#graphs

Algorithms

Kruskal vs Prim for MST — how do they differ?

#mst#kruskal#prim

Algorithms

A* vs Dijkstra — what’s the difference and when is A* faster?

#a-star#dijkstra#heuristics

Algorithms

Top-down vs bottom-up dynamic programming — what’s the difference?

#dynamic-programming#memoization#tabulation

Algorithms

Why doesn’t Dijkstra work with negative edge weights, and what can you use instead?

#dijkstra#bellman-ford#negative-weights