Pagini recente » Cod sursa (job #1572066) | Cod sursa (job #1934706) | Cod sursa (job #3272693) | Cod sursa (job #547580) | Cod sursa (job #884472)
Cod sursa(job #884472)
#include <cstdio>
#include <vector>
#define INF 2000000000
using namespace std;
int n,m,q[50010],d[50010],ordin[50010];
struct NOD
{
int x,cost;
};
vector <NOD> L[50010];
inline void Read()
{
int i,x;
NOD aux;
freopen("bellmanford.in","r",stdin);
scanf("%d %d", &n, &m);
for( i=1; i<=m; i++ )
{
scanf("%d %d %d",&x,&aux.x,&aux.cost);
L[x].push_back(aux);
}
}
inline bool BellmanFord(int k)
{
int i,x,pr,ul;
NOD aux;
for(i=1; i<=n ;i++)
d[i]=INF;
d[k]=0;
pr=ul=0;
q[ul]=k;
while(pr <= ul)
{
x=q[pr];
pr++;
for(i=0;i<L[x].size();i++)
{
aux=L[x][i];
if(d[aux.x]>d[x]+aux.cost)
{
ul++;
q[ul]=aux.x;
d[aux.x]=d[x]+aux.cost;
ordin[aux.x] = ordin[x] + 1;
if (ordin[aux.x] > n)
return true;
}
}
}
return false;
}
inline void Write(bool ciclu)
{
freopen("bellmanford.out","w",stdout);
if(ciclu)
{
printf("Ciclu negativ!\n");
}
else
{
int i;
for(i=2; i<=n; i++)
printf("%d ",d[i]);
printf("\n");
}
}
int main()
{
bool ciclu;
Read();
ciclu=BellmanFord(1);
Write(ciclu);
return 0;
}