Floyd-Warshall's all-pairs shortest path complexity

What is the time and space complexity of this all-pairs shortest path computation on a graph with V vertices, and what does the outer loop variable k represent?

main.cpp
for (int k = 0; k < V; k++)
    for (int i = 0; i < V; i++)
        for (int j = 0; j < V; j++)
            if (dist[i][k] + dist[k][j] < dist[i][j])
                dist[i][j] = dist[i][k] + dist[k][j];

19 of 46 in Data Structures & Algorithms