hdu-2544 最短路---模板题

题目链接：

http://acm.hdu.edu.cn/showproblem.php?pid=2544

题目大意：

1-N的最短路长度

解题思路：

dijkstra模板

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100 + 10;
const int INF = 0x3f3f3f3f;
int Map[maxn][maxn];
int v[maxn], d[maxn];
int n, m;
void dijkstra(int u)
{
    memset(v, 0, sizeof(v));
    for(int i = 0; i <= n; i++)d[i] = (i == u ? 0 : INF);
    for(int i = 0; i < n; i++)
    {
        int x, m = INF;
        for(int j = 1; j <= n; j++)if(!v[j] && d[j] <= m)m = d[x = j];
        v[x] = 1;
        for(int j = 1; j <= n; j++)
        {
            if(d[j] > d[x] + Map[x][j])
            {
                d[j] = d[x] + Map[x][j];
            }
        }
    }
    cout<<d[n]<<endl;
}
int main()
{
    while(cin >> n >> m && n)
    {
        int u, v, w;
        memset(Map, INF, sizeof(Map));
        while(m--)
        {
            cin >> u >> v >> w;
            Map[u][v] = Map[v][u] = w;
        }
        dijkstra(1);
    }
}