Pagini recente » Cod sursa (job #1344554) | Monitorul de evaluare | Cod sursa (job #1070087) | Monitorul de evaluare | Cod sursa (job #1230852)
#include <stdio.h>
#include <stdlib.h>
int n,dist[30][30];
void printDist()
{
int i, j;
for (i = 1; i <= n; ++i)
{
for (j = 1; j <= n; ++j)
printf("%3d", dist[i][j]);
printf("\n");
}
}
void floyd()
{
int i, j, k;
for (k = 1; k <=n; ++k)
{
for (i = 1; i <=n; ++i)
for (j = 1; j <=n; ++j)
if (((dist[i][k] + dist[k][j] < dist[i][j]) ||(dist[i][j] == 0))&& (dist[i][k]!=0) &&(dist[k][j] != 0) && (i != j))
dist[i][j] = dist[i][k] + dist[k][j];
}
printDist();
}
int main()
{
freopen("royfloyd.in", "r",stdin);
freopen("royfloyd.out", "w",stdout);
scanf( "%d", &n);
int i, j;
for (i =1; i <=n; ++i)
for (j =1; j <=n; ++j)
scanf("%d", &dist[i][j]);
floyd();
return 0;
}