Pagini recente » Cod sursa (job #497602) | Cod sursa (job #131913) | Cod sursa (job #2444173) | Cod sursa (job #791217) | Cod sursa (job #257721)
Cod sursa(job #257721)
#include<stdio.h>
#include<values.h>
#include<fstream.h>
long a[50][50],n,m,d[50],s[50];
void init ()
{
long i,j;
for (i=1;i<=n;++i)
{
d[i]=MAXLONG;
for (j=1;j<=n;++j)
a[i][j]=MAXLONG;
}
}
void read ()
{
ifstream f("dijkstra.in");
f>>n>>m;
init ();
long i,x,y,c;
for (i=1;i<=m;++i)
{
f>>x>>y>>c;
a[x][y]=c;
}
f.close();
}
void solve ()
{
long i,j,min,poz;
s[1]=1;
d[1]=0;
for (i=1;i<=n;++i)
if (a[1][i]<MAXLONG)
{
d[i]=a[1][i];
//t[i]=1;
}
for (i=1;i<=n-1;++i)
{
min=MAXLONG;
for (j=1;j<=n;++j)
if (d[j]<min && !s[j])
{
min=d[j];
poz=j;
}
s[poz]=1;
for (j=1;j<=n;++j)
if (!s[j] && a[poz][j]!=MAXLONG && d[j]>d[poz]+a[poz][j])
{
d[j]=d[poz]+a[poz][j];
//t[j]=poz;
}
}
}
void write ()
{
ofstream g("dijkstra.out");
long i;
for (i=2;i<=n;++i)
g<<d[i]<<" ";
g.close();
}
int main ()
{
read ();
solve ();
write ();
return 0;
}