Thuật toán FloyWarshall

createDist.cpp

path = vector<vector<int>>(length, vector<int>(length));
dist = vector<vector<int>>(length, vector<int>(length));
for (int i = 0; i < length; i++) {
    for (int j = 0; j < length; j++) {
        dist[i][j] = graph[i][j];
        if (graph[i][j] != INF && i != j) {
            path[i][j] = i;
        }
        else {
            path[i][j] = -1;
        }
    }
}