How Many Maos Does the Guanxi Worth （最短路问题）

题目描述：

"Guanxi" is a very important word in Chinese. It kind of means "relationship" or "contact". Guanxi can be based on friendship, but also can be built on money. So Chinese often say "I don't have one mao (0.1 RMB) guanxi with you." or "The guanxi between them is naked money guanxi." It is said that the Chinese society is a guanxi society, so you can see guanxi plays a very important role in many things. 

Here is an example. In many cities in China, the government prohibit the middle school entrance examinations in order to relief studying burden of primary school students. Because there is no clear and strict standard of entrance, someone may make their children enter good middle schools through guanxis. Boss Liu wants to send his kid to a middle school by guanxi this year. So he find out his guanxi net. Boss Liu's guanxi net consists of N people including Boss Liu and the schoolmaster. In this net, two persons who has a guanxi between them can help each other. Because Boss Liu is a big money(In Chinese English, A "big money" means one who has a lot of money) and has little friends, his guanxi net is a naked money guanxi net -- it means that if there is a guanxi between A and B and A helps B, A must get paid. Through his guanxi net, Boss Liu may ask A to help him, then A may ask B for help, and then B may ask C for help ...... If the request finally reaches the schoolmaster, Boss Liu's kid will be accepted by the middle school. Of course, all helpers including the schoolmaster are paid by Boss Liu. 

You hate Boss Liu and you want to undermine Boss Liu's plan. All you can do is to persuade ONE person in Boss Liu's guanxi net to reject any request. This person can be any one, but can't be Boss Liu or the schoolmaster. If you can't make Boss Liu fail, you want Boss Liu to spend as much money as possible. You should figure out that after you have done your best, how much at least must Boss Liu spend to get what he wants. Please note that if you do nothing, Boss Liu will definitely succeed.

Input

There are several test cases. 

For each test case: 

The first line contains two integers N and M. N means that there are N people in Boss Liu's guanxi net. They are numbered from 1 to N. Boss Liu is No. 1 and the schoolmaster is No. N. M means that there are M guanxis in Boss Liu's guanxi net. (3 <=N <= 30, 3 <= M <= 1000) 

Then M lines follow. Each line contains three integers A, B and C, meaning that there is a guanxi between A and B, and if A asks B or B asks A for help, the helper will be paid C RMB by Boss Liu. 

The input ends with N = 0 and M = 0. 

It's guaranteed that Boss Liu's request can reach the schoolmaster if you do not try to undermine his plan.

Output

For each test case, output the minimum money Boss Liu has to spend after you have done your best. If Boss Liu will fail to send his kid to the middle school, print "Inf" instead.

Sample Input

4 5
1 2 3
1 3 7
1 4 50
2 3 4
3 4 2
3 2
1 2 30
2 3 10
0 0

Sample Output

50
Inf

题意：暴发户给孩子办关系升学，需要一个人找一个人，人情钱都是这货出，你要劝说其中一个人不去帮忙使得暴发户花钱最多。你是劝说一个人使得他不去帮忙，而不是单纯的只使一个边变成inf！是与这个人相连的边都变成inf！还有就是虽说你想让这个人花钱最多，但是人家又不傻，当然会选择”最短路“来花钱！所以我们需要遍历每一个你试图劝服的人，也就是说你要删除1~n之间的每个点，对于每一个遍历，找到最短路，然后在最这n减2个最短路中找到最大的路，达到你的目的。

这个题可以用不同的算法遍历：

法一（Floyd算法，数据量很小，不用担心超时）：

AC代码：

#include<cstdio>
#include<cstring>
#define INF 0x3f3f3f3f
int n,s[40][40];
int floyd(int x)
{
	int k,i,j,dp[40][40];
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			if(i==x||j==x)
				dp[i][j]=INF;
			else
				dp[i][j]=s[i][j];
	for(k=1;k<=n;k++)
		for(i=1;i<=n;i++)
			for(j=1;j<=n;j++)
				if(dp[i][j]>dp[i][k]+dp[k][j])
				{
					dp[i][j]=dp[i][k]+dp[k][j];
				}
	return dp[1][n];
}
int main()
{
	int m,i,j,a,b,c;
	while(scanf("%d%d",&n,&m),n||m)
	{
		for(i=1;i<=n;i++)
			for(j=1;j<=n;j++)
			{
				s[i][j]=INF;
			}
		while(m--)
		{
			scanf("%d%d%d",&a,&b,&c);
			if(c<s[a][b])
				s[a][b]=s[b][a]=c;
		}
		int max=0;
		for(i=2;i<n;i++)
		{
			if(max<floyd(i))
				max=floyd(i);
		}
		if(max==INF)
			printf("Inf\n");
		else
			printf("%d\n",max);
	}
	return 0;
}

法二（Dijkstra算法，这个算法在这里好像有点麻烦了）：

AC代码：

#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
#define Inf 0x3f3f3f3f
const int maxn=35;
int n,m,maxt;
int G[maxn][maxn],ds[maxn],vis[maxn];
void getmap() {
	memset(G,Inf,sizeof(G));
	for(int i=1; i<=n; i++) G[i][i]=0;
	for(int i=1; i<=m; i++) {
		int a,b,val;
		scanf("%d%d%d",&a,&b,&val);
		if(G[a][b]>val) {
			G[a][b]=val;
			G[b][a]=val;
		}
	}
}
int Dijkstra(int x) {
	memset(vis,0,sizeof(vis));
	int dis[maxn][maxn];
	for(int i=1; i<=n; i++) {
		for(int j=1; j<=n; j++) {
			if(x==i||x==j)
				dis[i][j]=Inf;
			else dis[i][j]=G[i][j];
		}
	}
	for(int i=1; i<=n; i++) ds[i]=dis[1][i];
	vis[1]=1;
	for(int x=1; x<n; x++) {
		int mint=Inf,u;
		for(int i=1; i<=n; i++) {
			if(!vis[i]&&ds[i]<=mint) {
				mint=ds[i];
				u=i;
			}
		}
		vis[u]=1;
		for(int j=1; j<=n; j++) {
			if(ds[j]>ds[u]+dis[u][j])
				ds[j]=ds[u]+dis[u][j];
		}
	}
	return ds[n];
}
int main() {
	while(scanf("%d %d",&n,&m) ) {
		if(n==0&&m==0) break;
		getmap();
		maxt=0;
		int k;
		for(k=2; k<n; k++) {
			if(maxt<Dijkstra(k))
			maxt=Dijkstra(k);
		}
		if(maxt==Inf)
			printf("Inf\n");
		else
			printf("%d\n",maxt);
	}
	return 0;
}