#include <stdio.h>//弗洛伊德算法求解任意两点之间的距离
int main()
{
int a[100][100];
int i,j,k,n,m,c,d,e;
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (i==j)a[i][j]=0;
else a[i][j]=10000;
for (i=1;i<=m;i++)
{
scanf("%d%d%d",&c,&d,&e);
a[c][d]=e;
}
for (k=1;k<=n;k++)//通过k点周转
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if ((a[i][k]!=10000)&&(a[k][j]!=10000)&&(a[i][j]>a[i][k]+a[k][j]))
a[i][j]=a[i][k]+a[k][j];
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}
弗洛伊德算法
最新推荐文章于 2021-01-27 12:36:17 发布