最短路—1001

#include
#include
int map[101][101],n,a[101],v[101];
void dij()
{
    int i,j,min,min_f=0;
    for(i=1;i<=n;i++)
    {
        a[i]=map[1][i];
        v[i]=0;
    }
    v[1]=1;
    for(i=1;i     {
        min=100000000;min_f=0;
        for(j=1;j<=n;j++)
        {
            if(!v[j]&&a[j]             {
                min=a[j];
                min_f=j;
            }
        }
        v[min_f]=1;
        for(j=1;j<=n;j++)
        {
            if(!v[j]&&a[j]>a[min_f]+map[min_f][j])
                a[j]=a[min_f]+map[min_f][j];
        }
    }
    printf("%d\n",a[n]);
}
int main()
{
    int m,i,j;
    while(scanf("%d%d",&n,&m)&&n!=0&&m!=0)
    {
        for(i=1;i<=n;i++)
            for(j=i;j<=n;j++)
            {
                if(i==j)
                    map[i][j]=0;
                else
                    map[i][j]=map[j][i]=100000000;
            }
        for(i=0;i         {
            int a,b,c;
            scanf("%d%d%d",&a,&b,&c);
            map[a][b]=map[b][a]=c;
        }
        dij();
    }
    return 0;
}