Cod sursa(job #1125485)
| Utilizator | Data | 26 februarie 2014 17:56:17 | |
|---|---|---|---|
| Problema | Algoritmul lui Dijkstra | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
#define inf 100000
using namespace std;
int n,m,x,y,c,a[101][101];
void roy()
{
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
a[i][j]=min(a[i][j],a[k][j]+a[i][k]);
}
int main()
{
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
f>>n>>m;
for(int i=1; i<=m; i++)
{
f>>x>>y>>c;
a[x][y]=c;
}
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(a[i][j]==0)a[i][j]=inf;
roy();
for(int i=2; i<=n; i++)
g<<a[1][i]<<" ";
return 0;
}
