如何用 floyd 算法 解决从一个出发再回到这个顶点的负权值问题

1.题目引入：

While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that is BEFORE you entered the wormhole! Each of FJ's farms comprises N (1 ≤ N ≤ 500) fields conveniently numbered 1..N, M (1 ≤ M ≤ 2500) paths, and W (1 ≤ W ≤ 200) wormholes.

As FJ is an avid time-traveling fan, he wants to do the following: start at some field, travel through some paths and wormholes, and return to the starting field a time before his initial departure. Perhaps he will be able to meet himself :) .

To help FJ find out whether this is possible or not, he will supply you with complete maps to F (1 ≤ F ≤ 5) of his farms. No paths will take longer than 10,000 seconds to travel and no wormhole can bring FJ back in time by more than 10,000 seconds.

Input

Line 1: A single integer, F. F farm descriptions follow. 
Line 1 of each farm: Three space-separated integers respectively: N, M, and W 
Lines 2..M+1 of each farm: Three space-separated numbers (S, E, T) that describe, respectively: a bidirectional path between S and E that requires T seconds to traverse. Two fields might be connected by more than one path. 
Lines M+2..M+W+1 of each farm: Three space-separated numbers (S, E, T) that describe, respectively: A one way path from S to E that also moves the traveler back T seconds.

Output

Lines 1..F: For each farm, output "YES" if FJ can achieve his goal, otherwise output "NO" (do not include the quotes).

2.样例输出： 

Sample Input

2
3 3 1
1 2 2
1 3 4
2 3 1
3 1 3
3 2 1
1 2 3
2 3 4
3 1 8

Sample Output

NO
YES

Hint

For farm 1, FJ cannot travel back in time. 
For farm 2, FJ could travel back in time by the cycle 1->2->3->1, arriving back at his starting location 1 second before he leaves. He could start from anywhere on the cycle to accomplish this.

题目大意：寻找从任意点出发回到该点是否存在权值为负值的情况，如果存在则输出“YES”,否则输出“NO”。

本题采用floyd算法解决负权值问题，当然也可采用Bellman-Ford 算法，这个算法之后会细说。这里不能用 Dijkstra（算法），因为他每次都要对路径进行压缩，如果存在负权边那么必然会对这条边进行多次遍历，并且每次便利都会缩短原有的权值，最终导致答案错误。

具体代码实现如下：

3.代码如下： 

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
const int maxn=5e2+10;
int e[maxn][maxn],n,m,k;
int inf=0x3f3f3f3f;
int ff()
{
	for(int k=1;k<=n;k++)
	{
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=n;j++)
			{
				if(e[i][j]>e[i][k]+e[k][j])  //每次进行松弛后它的最短路径就已经从“估计值”变成“确定值”。 
				{
					e[i][j]=min(e[i][j],e[i][k]+e[k][j]);
					if(e[i][i]<0)      	//从一个点出发最后再回到这个顶点如果小于 0 则返回 ture  
					{
						return 1;
					}
				}
			}
		}
	}
	return 0;
}
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int a,b,c;
		cin>>n>>m>>k;
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=n;j++)
			{
				if(i==j)
				{
					e[i][j]=0;
				}
				else
				{
					e[i][j]=inf;		
				}
			}
		}
		for(int i=1;i<=m;i++)
		{
			cin>>a>>b>>c;
			if(e[a][b]>c)
			{
				e[a][b]=e[b][a]=c;
			}
		}
		for(int i=1;i<=k;i++)
		{
			cin>>a>>b>>c;
			e[a][b]=-c;        		//单独记录负权边 
		}
		if(!ff())
		{
			cout<<"NO"<<endl;
		}
		else
		{
			cout<<"YES"<<endl;
		}
	}
	return 0;
}