HDU 2544 最短路

参考：https://blog.csdn.net/shuangde800/article/details/7987134

https://blog.csdn.net/gfvod/article/details/51506901

https://blog.csdn.net/u011466175/article/details/11906001

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int N=110;
const int inf=0x3f3f3f3f;
int in[N][N];
int n,m;
void read()
{
    memset(in,0x3f,sizeof(in));
    for (int i=0;i<m;i++)
    {
        int a,b,c;
        cin>>a>>b>>c;
        in[a][b]=in[b][a]=c;
    }
}
void floyd()
{
    for (int k=1;k<=n;k++)
    {
        for (int i=1;i<=n;i++)
        {
            for (int j=1;j<=n;j++)
            {
                if (in[i][k]+in[k][j]<in[i][j])
                {
                    in[i][j]=in[i][k]+in[k][j];
                }
            }
        }
    }
}
int main()
{
    while (cin>>n>>m,n+m)
    {
        read();
        floyd();
        cout<<in[1][n]<<endl;
    }

    return 0;
}