Cod sursa(job #372770)
Utilizator | Data | 11 decembrie 2009 17:39:06 | |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<iostream.h>
#include<fstream.h>
int i,j,k,n,m,a[250][4],d[50],ok=1;
ifstream f("dijkstra.in");
ofstream h("dijkstra.out");
int main()
{f>>n>>m;
for(i=1;i<=m;i++)
{f>>a[i][1]>>a[i][2]>>a[i][3];}
for(i=2;i<=n;i++)
d[i]=1000;
d[1]=0;
ok=1;
while(ok==1)
{ ok=0;
for(k=1;k<=m;k++)
if(d[a[k][2]] > d[a[k][1]] + a[k][3])
{d[a[k][2]]=d[a[k][1]]+a[k][3];
ok=1;}
}
for(i=2;i<=n;i++)
h<<d[i]<<" ";
return 0;
}