Practical Constraints

Floyd-Warshall is $O(n^3)$. This is acceptable when $n \leq 400$ or so. If $n > 500$, $n^3$ becomes too large (over $125$ million operations). Consider Johnson's algorithm or sparse techniques. Floyd-Warshall shines for small to medium graphs or when you need all-pairs distances without complex code.

The simplicity makes it a good choice in competitive programming when $n$ is small. For production systems, measure carefully.

Space complexity is $O(n^2)$ for the distance matrix.