Pagini recente » Cod sursa (job #2681768) | Cod sursa (job #1583631) | Cod sursa (job #2291346) | Cod sursa (job #1279348) | Cod sursa (job #1898568)
#include <iostream>
#include <fstream>
#define pinf 10000000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int a[10000][10000],m,d[10000],viz[10000],n,p=1;
void citire()
{
fin>>n>>m;
int x,y,c,i,j;
for(i=1; i<=n; i++)
{
for(j=1; j<=m; j++)
if(i==j)
a[i][j]=0;
else
a[i][j]=pinf;
}
for(i=1; i<=m; i++)
{
fin>>x>>y>>c;
a[x][y]=c;
}
}
void afisare()
{
int i,j;
for(i=2;i<=n;i++)
{
if(d[i]==pinf)
fout<<"-1"<<" ";
else
fout<<d[i]<<" ";
}
}
int main()
{
citire();
int k,i,j;
for(i=1;i<=n;i++)
d[i]=a[p][i];
viz[p]=1;
d[1]=0;
d[0]=pinf;
int pmin=d[0];
for(k=1;k<n;k++)
{ pmin =0;
for(i=1;i<=n;i++)
{
if(viz[i]==0&&d[i]<d[pmin])
{
pmin=i;
}
if(pmin>-1)
{
viz[pmin]=1;
for(j=1;j<=n;j++)
if(viz[i]==0&&d[i]>d[pmin]+a[pmin][i])
d[i]=d[pmin]+a[pmin][i];
}
}
}
afisare();
return 0;
}