Pagini recente » Rezultatele filtrării | Rezultatele filtrării | Cod sursa (job #1044799) | Rezultatele filtrării | Cod sursa (job #2866214)
#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
const int NMAX=50005;
const int oo=(1 << 30);
int n,m;
int D[NMAX];
bool Incoada[NMAX];
vector < pair < int,int > > G[NMAX];
struct comparaDistante
{
bool operator()(int x,int y )
{return D[x]>D[y];}
};
priority_queue < int , vector < int >, comparaDistante > Coada;
void Citeste()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y,c;
f>>x>>y>>c;
G[x].push_back(make_pair(y,c));
}
}
void Dijkstra(int nodstart)
{
for(int i=1;i<=n;i++)
D[i]=oo;
D[nodstart]=0;
Coada.push(nodstart);
Incoada[nodstart]=true;
while(!Coada.empty())
{
int nodcurent=Coada.top();
Coada.pop();
Incoada[nodcurent]=false;
for(size_t i=0;i<G[nodcurent].size();i++)
{
int Vecin=G[nodcurent][i].first;
int Cost= G[nodcurent][i].second;
if(D[nodcurent]+Cost<D[Vecin])
{
D[Vecin]=D[nodcurent]+Cost;
if(Incoada[Vecin]==false)
{
Coada.push(Vecin);
Incoada[Vecin]=true;
}
}
}
}
}
void Afiseaza()
{
for(int i=2;i<=n;i++)
if(D[i]!=oo)
g<<D[i]<<" ";
else
g<<"0 ";
}
int main()
{
Citeste();
Dijkstra(1);
Afiseaza();
return 0;
}