Floyd–Warshall algorithm

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

High-confidence facts extracted from structured source data. Use them as anchors for further research.

Average performance

Θ ( | V | 3 ) {\displaystyle \Theta (|V|^{3})}

Best-case performance

Θ ( | V | 3 ) {\displaystyle \Theta (|V|^{3})}

Class

All-pairs shortest path problem (for weighted graphs)

Data structure

Graph

Worst-case performance

Θ ( | V | 3 ) {\displaystyle \Theta (|V|^{3})}

Worst-case space complexity

Θ ( | V | 2 ) {\displaystyle \Theta (|V|^{2})}