Does rearranging the outerloop in Floyd-Warshall algorithm as most inner loop change the algorithm

Question

The following code is for Floyd-Warshall algorithm

for (int k = 0; k < n; ++k) {
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j