/*
bellman-ford算法,但有bug
*/
#include <iostream>
#include <cstdio>
#define INF 0x3f3f3f3f
using namespace std;
const int maxn=1e5+5;
struct edge{
int from,to;
int cost;
}e[maxn];
int n,m,s,t;
int dis[maxn];
int bellman_ford(){
for(int i=1;i<=n;i++)dis[i]=INF;
dis[s]=0;
for(int i=1;i<=n-1;i++){//因为是对边操作,所以最多只能有n-1次
for(int j=1;j<=m;j++){
if(dis[e[j].to]>dis[e[j].from]+e[j].cost){
dis[e[j].to]=dis[e[j].from]+e[j].cost;
}
}
}
for(int i=1;i<=m;i++){//如果还能继续执行的话,就是有负环的存在了
if(dis[e[i].to>dis[e[i].from]]+e[i].cost)return 1;
}
return 0;
}
int main(){
cin>>n>>m>>s>>t;
for(int i=1;i<=m;i++){
int form,to,cost;
scanf("%d%d%d",&from,&to,&cost);
e[i].from=from,e[i].to=to,e[i].cost=cost;//构建有向图
}
if(bellman_ford()==1){
printf("有负环\n");
}else{
if(dis[t]!=INF)printf("%d\n",dis[t]);
else printf("-1\n");
}
return 0;
}
转载于:https://www.cnblogs.com/Emcikem/p/11448441.html