Pagini recente » Cod sursa (job #214778) | Cod sursa (job #2530997) | Cod sursa (job #262815) | Cod sursa (job #2697082) | Cod sursa (job #2200449)
#include <fstream>
#include <vector>
#define NMAX 50000
#define INF 2000000000
using namespace std;
ifstream fi("dijkstra.in");
ofstream fo("dijkstra.out");
int n, m, mini;
int VIZ[NMAX+5], DIST[NMAX+5];
vector <pair <int, int> > OUT[NMAX+5];
void citire(void)
{
int x, y, c;
fi>>n>>m;
for(int i=1; i<=m; i++)
{
fi>>x>>y>>c;
OUT[x].push_back(make_pair(y, c));
}
}
void dijkstra(int src)
{
int nod, nods;
for(int i=1; i<=n; i++)
DIST[i]=INF;
DIST[src]=0;
for(int i=1; i<=n-1; i++)
{
mini=INF;
for(int j=1; j<=n; j++)
{
if(!VIZ[j] && mini>DIST[j])
{
mini=DIST[j];
nod=j;
}
for(int k=0; k<OUT[nod].size(); k++)
{
nods=OUT[nod][k].first;
DIST[nods]=min(DIST[nods], DIST[nod]+OUT[nod][k].second);
}
VIZ[nod]=1;
}
}
}
void afisare(void)
{
for(int i=2; i<=n; i++)
fo<<DIST[i]<<" ";
}
int main()
{
citire();
dijkstra(1);
afisare();
fi.close();
fo.close();
return 0;
}