Floyd算法求各顶点最短路径
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
for(int k = 1; k<=n; k++
if (map[i][j] > map[i][k] + map[k][j])
//在Vi与Vj之间,先走点Vk的距离比原来Vi直接到Vj的距离要短
map[i][j] = map[i][k] + map[k][j];
//Vi到Vj的距离更新
下面没了,快给?点个赞