Cod sursa(job #1439351)
| Utilizator | Data | 22 mai 2015 10:32:27 | |
|---|---|---|---|
| Problema | Algoritmul lui Dijkstra | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<iostream.h>
#include<fstream.h>
long long a[9000][9000];
int main()
{
int i,j,k,n,m,x,y,z;
ifstream f("dijkstra.txt");
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
a[i][j]=10000;
for(i=1;i<=m;i++)
{
f>>x>>y>>z;
a[x][y]=z;
}
for(k=1;k<=n;k++)
for(j=1;j<=n;j++)
if(a[1][k]+a[k][j]<a[1][j]&&i!=k&&j!=k)
a[1][j]=a[1][k]+a[k][j];
for(i=2;i<=n;i++)
cout<<a[1][i]<<" ";
return 0;
}
