floyd算法模板

#include<iostream>
#include<cstdio>
#define INF 0x3f3f3f3f
using namespace std;

int nodenum,edgenum;
int map[1100][1100];

void init()//输入数据 
{
	int i,j;
	int u,v,weight;
	cin>>nodenum>>edgenum;//6,8
	for(i=0;i<=nodenum+1;i++)
	{
		for(j=0;j<=nodenum+1;j++)
		{
			map[i][j]=INF;
		}
	}
	for(i=1;i<=edgenum;i++)
	{
		cin>>u>>v>>weight;
		if(map[u][v]>weight)
		map[u][v]=weight;
	}
	return ;
}

void floyd_d()//进行点之间的松弛 
{
	int i,j,k;
	for(k=0;k<=nodenum-1;k++)//循环nodenum-1次，而且K是中间点 
	{
		for(i=0;i<=nodenum-1;i++)
		{
			for(j=0;j<=nodenum-1;j++)
			{
				if(map[i][j]>map[i][k]+map[k][j])
				map[i][j]=map[i][k]+map[k][j];
			}
		}
	}
	return ;
}

int main()
{
	int n,m;
	init();
	floyd_d();
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		if(n==0&&m==0)
		break;
		if(map[n][m]!=INF)
		printf("%d\n",map[n][m]);
		else
		printf("INF\n");
	}
	return 0;
}