Pagini recente » Cod sursa (job #2033651) | Cod sursa (job #759981) | Cod sursa (job #2508895) | Cod sursa (job #2420289) | Cod sursa (job #246559)
Cod sursa(job #246559)
#include<stdio.h>
#define max_n 50001
#define infinit 1<<30
FILE *in=fopen("royfloyd.in","r");
FILE *out=fopen("royfloyd.out","w");
struct nod{int nd,inf; nod *urm;} *l[max_n];
int d[max_n],v[max_n],n;
void citire()
{
nod *c;
fscanf(in,"%d %d",&n);
int z,i,j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
fscanf(in,"%d",&z);
if(i!=j && z)
{
c=new nod;
c->nd=j;
c->inf=z;
c->urm=l[i];
l[i]=c;
}
}
}
int main()
{
citire();
int i,min,poz,k;
nod *c;
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
d[i]=infinit;
for(c=l[k];c;c=c->urm)
d[c->nd]=c->inf;
v[k]=1;
for(i=1;i<n;i++)
{
min=infinit;
for(int j=1;j<=n;j++)
if(!v[j] && min>d[j] && d[j]!=infinit)
min=d[j],poz=j;
if(min!=infinit)
{
v[poz]=1;
for(c=l[poz];c;c=c->urm)
if(d[poz]+c->inf<d[c->nd])
d[c->nd]=d[poz]+c->inf;
}
}
for(i=2;i<=n;i++)
fprintf(out,"%d ",d[i]==infinit ? 0 : d[i]);
fprintf(out,"\n");
}
fclose(out);
return 0;
}