Bellman_ford Shortest circuit

1#include <cstdio>2#include <iostream>3#include <algorithm>4#include <cstring>5#include <cmath>6#include <queue>7 #defineINF 0x3f3f3f3f8 Const intMAXN = $;9 intN, M, PRE[MAXN], EDGE[MAXN * maxn][3];Ten intDIST[MAXN]; One BOOLRelaxintUintVintc) { A     if(Dist[v] > Dist[u] +c) { -DIST[V] = Dist[u] + C; PRE[V] =u; -         return true; the     } -     return  false; - } - intBellmanintS) { +     intI, J; -      for(i =0; I < n; i + +){ +Dist[i] =inf; APre[i] =-1; at     } -Dist[s] =0; -     BOOLFlag; -      for(i =1; i < n; i + +){ -Flag =false; -          for(j =0; J < M; J + +) in             if(Relax (edge[j][0], edge[j][1], edge[j][2]) flag =true; -         if(!flag) Break; to     } +      for(j =0; J < M; J + +) -         if(Relax (edge[j][0], edge[j][1], edge[j][2]))return false; the     return true; *}

Bellman_ford Shortest circuit