Pagini recente » Cod sursa (job #903086) | Cod sursa (job #2670785) | Cod sursa (job #1613901) | Cod sursa (job #1076881) | Cod sursa (job #278603)
Cod sursa(job #278603)
#include<stdio.h>
int a[105][105];
int n;
void citire()
{
int i,j;
FILE *in = fopen("royfloyd.in","rt");
fscanf(in,"%d",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fscanf(in,"%d",&a[i][j]);
fclose(in);
}
void royfloyd()
{
int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
// daca avem muchie de la i->k si de la k->j
if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
a[i][j] = a[i][k] + a[k][j];
}
int main()
{
int i,j;
citire();
royfloyd();
FILE *out = fopen("royfloyd.out","wt");
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
fprintf(out,"%d ",a[i][j]);
fprintf(out,"\n");
}
fclose(out);
return 0;
}