Pagini recente » Cod sursa (job #2342180) | Cod sursa (job #1939978) | Cod sursa (job #2711677) | Cod sursa (job #1889513) | Cod sursa (job #2964905)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
typedef pair<int,int> pii;
const int INF=1e9;
int n,m;
vector<pii> muchii[50005];
int dist[50005];
int cnt[50005];
queue<pii> coada;
void bellman()
{
for(int i=2;i<=n;i++)
dist[i]=INF;
dist[1]=0;
coada.push({0,1});
while(!coada.empty())
{
int nod=coada.front().second;
coada.pop();
cnt[nod]++;
if(cnt[nod]>n)
{
fout<<"Ciclu negativ!";
exit(0);
}
for(auto i:muchii[nod])
if(dist[i.first]>dist[nod]+i.second)
{
dist[i.first]=dist[nod]+i.second;
coada.push({dist[i.first],i.first});
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
fin.tie(0);
fin>>n>>m;
for(int i=1;i<=m;i++)
{
int a,b,c;
fin>>a>>b>>c;
muchii[a].push_back({b,c});
}
bellman();
for(int i=2;i<=n;i++)
fout<<dist[i]<<' ';
return 0;
}