Pagini recente » Cod sursa (job #1616307) | Cod sursa (job #766102) | Cod sursa (job #2847821) | Cod sursa (job #2960251) | Cod sursa (job #1251069)
#include <fstream>
#include <queue>
#include <cstring>
#include <vector>
#define inf 0x3f3f3f3f
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
vector <pair <int,int> >g[50005];
queue <int> q;
int n,m,d[50005],nrit[50005],viz[50005];
bool neg=0;
void citire()
{
int x,y,c;
fin>>n>>m;
for(int i=1;i<=m;i++)
{
fin>>x>>y>>c;
g[x].push_back(make_pair(y,c));
}
memset(d,inf,sizeof(d));
memset(nrit,0,sizeof(nrit));
memset(viz,0,sizeof(viz));
q.push(1);
d[1]=0;
}
void rezolv()
{
int k;
while(!q.empty()&&!neg)
{
k=q.front();
q.pop();
viz[k]=0;
vector <pair <int,int> >::iterator ii;
for(ii=g[k].begin();ii!=g[k].end();++ii)
{
if(d[ii->first]>d[k]+ii->second)
{
d[ii->first]=d[k]+ii->second;
if(viz[ii->first]==0)
{
if(nrit[ii->first]>n)
neg=1;
else
{
viz[ii->first]=1;
q.push(ii->first);
nrit[ii->first]++;
}
}
}
}
}
}
void afisare()
{
if(neg==0)
for(int i=2;i<=n;i++)
fout<<d[i]<<" ";
else
fout<<"Ciclu negativ!";
}
int main()
{
citire();
rezolv();
afisare();
return 0;
}