Pagini recente » Cod sursa (job #3292905) | Cod sursa (job #729240) | Cod sursa (job #1984521) | Cod sursa (job #2947905) | Cod sursa (job #1358530)
#include <iostream>
#include <fstream>
using namespace std;
const int inf=999999;
int main()
{ int x,y,d,n,m,a[100][100]={0},i,j,k;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j)
a[i][j]=inf;
for(i=1;i<=m;i++)
{f>>x>>y>>d;
a[x][y]=d;
a[y][x]=d;
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
if(a[i][k]+a[k][j]<a[i][j])
a[i][j]=a[i][k]+a[k][j];
for(i=2;i<=n;i++)
g<<a[1][i]<<" ";
return 0;
}