图论-最短路-floyd

#include <iostream>
#include <algorithm>

using namespace std;

const int MAX_V = 100;

int d[MAX_V][MAX_V];
int V;

void warshall_floyd() {
for (int k = 0; k < V; k++) {
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++)
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
int main() {

return 0;
}