floyd_warshall.cpp

// Assume N is the number of vertices
for (int k = 0; k < N; k++) {
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            dist[i][j] = min(dist[i][j], 
                             dist[i][k] + dist[k][j]);
        }
    }
}