Pagini recente » Cod sursa (job #757170) | Cod sursa (job #2124686) | Cod sursa (job #2470215) | Cod sursa (job #1531177) | Cod sursa (job #1922235)
#include <fstream>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int a[5000][5000],n,m,x,y,c,b[20000][20000];
int main()
{
fin>>n>>m;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
b[i][j]=1000000;
for(int i=1;i<=n;++i)
{
fin>>x>>y>>c;
a[x][y]=c;
b[x][y]=c;
}
for(int k=1;k<=n;++k)
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
b[i][j]=min(b[i][j],b[i][k]+b[k][j]);
for(int i=2;i<=n;++i)
fout<<b[1][i]<<" ";
return 0;
}