Pagini recente » Cod sursa (job #915792) | Cod sursa (job #1491510) | Cod sursa (job #258389) | Cod sursa (job #2725011) | Cod sursa (job #1086686)
#include <iostream>
#include <fstream>
#define inf 10000;
using namespace std;
int n, x0;
double c[1000][1000], d[1000];
int pre[1000], M[1000];
ofstream g("dijkstra.out");
void initializare();
void afisare();
int main()
{
int i, vfmin, j;
double dmin;
initializare();
for(j=1;j<n;j++)
{
dmin=inf;
for(i=1;i<=n;i++)
if(!M[i] && dmin>d[i])
{
dmin=d[i];
vfmin=i;
}
M[vfmin]=1;
for(i=1;i<=n;i++)
if(!M[i] && d[i]>dmin+c[vfmin][i])
{
pre[i]=vfmin;
d[i]=dmin+c[vfmin][i];
}
}
afisare();
return 0;
}
void initializare()
{
int i, j, m, x, y;
double cost;
ifstream f("dijkstra.in");
f>>n>>m;
x0=1;
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
c[j][i]=c[i][j]=inf;
for(i=1;i<=m;i++)
{
f>>x>>y>>cost;
c[x][y]=cost;
}
for(i=1;i<=n;i++)
{
d[i]=c[x0][i];
pre[i]=x0;
}
M[x0]=1;
pre[x0]=0;
f.close();
}
void afisare()
{
int i, j, lg, dr[1000];
for(i=1;i<=n;i++)
if(i!=x0)
g<<d[i]<<' ';
}