Quiz: Floyd-Warshall Loop Order

Floyd-Warshall uses $3$ nested loops: $k$, $i$, $j$. What happens if you put $k$ as the innermost loop instead of the outermost?

1. A.The algorithm runs faster due to better cache performance
2. B.The algorithm produces wrong answers because intermediate vertices are not fully processed before being used
3. C.The algorithm still works but uses more memory
4. D.The algorithm works for undirected graphs but fails for directed ones