Uva 558 Wormholes
解題： 使用Bellman Ford's Algorithm判斷是否有負迴圈 Code： #include<stdio.h> #include<stdlib.h> #include<iostream> #include<algorithm> #include<string.h> #include<vector> #define INF 100000000 using namespace std ; struct edge { int cost , u , v ; }; edge edges [ 2005 ]; bool BellmanFord ( int n , int m ) { int dis [ 1005 ]; for ( int i = 0 ; i < n ; i ++) { if ( i == 0 ) dis [ i ]= 0 ; else dis [ i ]= INF ; } for ( int i = 0 ; i <= n - 1 ; i ++) { for ( int j = 0 ; j < m ; j ++) { if ( dis [ edges [ j ]. v ]> dis [ edges [ j ]. u ]...