【解题报告】【HDOJ2544】【Floyd最短路】最短路

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2544

#include<stdio.h>
#include<string.h>
#define INF 0x3f3f3f3f
#define min(a,b) (a>b?b:a)
int map[101][101];
int main()
{
    int n,m,i,j,k,a,b,c;
    //freopen("1.txt","r",stdin);
    while(scanf("%d%d",&n,&m)!=EOF&&(n!=0||m!=0))
    {
        memset(map,INF,sizeof(map));
        for(i=0;i<m;i++)
        { 
            scanf("%d%d%d",&a,&b,&c);
            map[a][b]=min(c,map[a][b]);
            map[b][a]=map[a][b];    
        }
        
        
        for(k=1;k<=n;k++)
        {
            for(i=1;i<=n;i++)
                for(j=1;j<=n;j++)
                    if(map[i][j]>map[i][k]+map[k][j])
                    {
                        map[i][j]=map[i][k]+map[k][j];
                        map[j][i]=map[i][j];
                    }
        }
        
        if(n==1) printf("0\n");
        else printf("%d\n",map[1][n]);
    }
    return 0;
}