Folyd 算法模板

int dist[Max][Max], path[Max][Max], cost[Max][Max];
void Floyd(int n)
{
int i, j, k;
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
{
dist[i][j] = cost[i][j];
if(i!=j && dist[i][j]<Maxint)
path[i][j] = i;
else
path[i][j] = -1;
}
for (k=1; k<=n; k++)
{
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
{
if(dist[i][j] > dist[i][k]+dist[k][j])
{
dist[i][j] = dist[i][k] + dist[k][j];
path[i][j] = k;
}
}
}
}