Pagini recente » Cod sursa (job #1737949) | Rating Ovidiu Moldovanu (Nakamura11) | Cod sursa (job #1016232) | Cod sursa (job #2280414) | Cod sursa (job #2173344)
#include <iostream>
#include <fstream>
#define infinit 1000000
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
long int v[10000][10000],n,m,p;
void citire()
{
int x,y,c;
in>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(i!=j)
v[i][j]=infinit;
for(int i=1;i<=m;i++)
{
in>>x>>y>>c;
v[x][y]=v[y][x]=c;
}
in.close();
}
void roy_floyd()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(v[i][j]>v[i][k]+v[k][j])
v[i][j]=v[i][k]+v[k][j];
}
void afisare()
{
for(int i=2;i<=n;i++)
out<<v[i]<<' ';
}
int main()
{
citire();
roy_floyd();
afisare();
}