找负环 bellman ford 算法

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <iostream>
#include <sstream>
#include <ostream>
#include <algorithm>
#include <ctype.h>
#include <cmath>
#include <queue>
#include <vector>
#define inf 1e9+7
#define pi acos(-1)
#define natrule exp(1)
using namespace std;
struct edge{
    int to,from,weight;
};
int d[1005];
edge eg[1005];
bool find_negtive_loop(int m, int n){
    memset(d,0,sizeof(d));//随意设置一个除了inf之外的值
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            edge e=eg[i];
            if(d[e.to]>d[e.from]+e.weight){
                d[e.to]=d[e.from]+e.weight;
                if(i==n-1) return true;
            }
        }
    }
    return false;
}

<p style="margin-top: 0px; margin-bottom: 0px; font-size: