Pagini recente » Cod sursa (job #2651303) | Cod sursa (job #2339308) | Cod sursa (job #2339286) | Cod sursa (job #1943734) | Cod sursa (job #606388)
Cod sursa(job #606388)
#include<fstream.h>
#define N 50001
#define M 1500000
typedef struct
{long u,v,k,e[M];}qu;
typedef struct nod
{long co,in;
struct nod *urm;}Nod;
Nod *g[N],*r;
qu q;
long m,k,d[N],c,n,i,j,p,t,l;
void aQ(qu &q,long x)
{q.k++,q.e[q.v++]=x;}
long dQ(qu &q)
{q.k--,q.u++;
return q.e[q.u-1];}
void push(Nod *&r,long x,long c)
{Nod *p=new Nod;
p->in=x,p->co=c,p->urm=r,r=p;}
int main()
{q.k=q.u=q.v=0;
ifstream f("bellmanford.in");
ofstream h("bellmanford.out");
f>>n>>m;
for(i=1;i<=n;i++)
d[i]=N,g[i]=NULL;
while(m--)
f>>l>>j>>c,push(g[l],j,c);
d[1]=0,aQ(q,1);
while(q.k)
{t=dQ(q);
for(r=g[t];r;r=r->urm)
if(d[r->in]>d[t]+r->co)
d[r->in]=d[t]+r->co,aQ(q,r->in);
else
if(d[r->in]>0&&d[t]<0)
{h<<"Ciclu negativ!";
return 0;}}
for(p=2;p<=n;p++)
if(d[p]>0)
h<<(d[p]%N)<<" ";
else
h<<d[p]<<" ";
return 0;}