Thuật toán FloyWarshall

FloyWarshall.cpp

for (int k = 0; k < length; k++) {
    for (int i = 0; i < length; i++) {
        for (int j = 0; j < length; j++) {
            if (dist[i][j] > dist[i][k] + dist[k][j]) {
                dist[i][j] = dist[i][k] + dist[k][j];
                path[i][j] = path[k][j];
            }
        }
    }
}