Pagini recente » Cod sursa (job #2555307) | Cod sursa (job #366482) | Cod sursa (job #462437) | Cod sursa (job #1132193) | Cod sursa (job #1817133)
#include <bits/stdc++.h>
#define INF 2000000000
using namespace std;
struct muchie{
int nod,cost;
};
int n,m,S,T;
int sol[50003];
queue<int>q;
vector<muchie>L[50003];
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
void Citire()
{
int i,x,y,c;
muchie w;
fin>>n>>m;
for(i=1;i<=m;++i)
{
fin>>x>>y>>c;
w.nod=y;
w.cost=c;
L[x].push_back(w);
}
}
void BFS()
{
int x,y,c;
unsigned int j;
sol[1]=0;
q.push(1);
while(!q.empty())
{
x=q.front();
q.pop();
for(j=0;j<L[x].size();++j)
{
y=L[x][j].nod;
c=L[x][j].cost;
if(sol[y]>sol[x] + c)
{
sol[y]=sol[x] + c;
q.push(y);
}
}
}
}
void Afisare()
{
int i;
for(i=2;i<=n;++i)
fout<<sol[i]<<" ";
fout<<"\n";
}
int main()
{
int i;
Citire();
for(i=1;i<=n;++i)
sol[i]=INF;
BFS();
Afisare();
return 0;
}