hdu 2544 最短路（Dijkstra模板）

#include <set>
#include <map>
#include <queue>
#include <deque>
#include <cmath>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF  0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-9
#define maxn 1000010
#define MOD 1000000007
#define zero(x) (((x)>0?(x):-(x))<eps)

int mp[110][110],dis[110];
int n,m,vis[110];

void Dijkstra(int x)
{
    memset(vis,0,sizeof(vis));
	for(int i = 1; i <= n; i++)
		dis[i] = mp[x][i];
	vis[x] = 1;
	for (int i = 1; i<= n; i++)
	{
	    int p;
		int Min = INF;
		for(int j = 1; j <= n; j++)
		{
			if(!vis[j] && dis[j] < Min)
			{
				p = j;
				Min = dis[j];
			}
		}
		vis[p] = 1;
		for(int j = 1; j <= n; j++)
			if(!vis[j] && dis[p] + mp[p][j] < dis[j])
                dis[j] = dis[p] + mp[p][j];
	}
}

int main()
{
	while(scanf("%d%d",&n,&m) && (n+m))
	{
        memset(mp,INF,sizeof(mp));
		for(int i = 1; i <= m; i++)
		{
		    int a,b,t;
			scanf("%d%d%d",&a,&b,&t);
			mp[a][b] = t;
			mp[b][a] = t;
		}
		Dijkstra(1);
		printf("%d\n",dis[n]);
	}
	return 0;
}