最短路 dijkstra+优先队列+邻接表

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

#include<iostream>
#include<queue>
#include<functional>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
const int N = 1e3+5;
const int INF = 1e7;
typedef pair<int, int> pll;
struct Node
{
    int next;
    int s;
    Node(int nt, int d):next(nt), s(d){};
};
vector<Node> G[N];
int dis[N];
void dijkstra()
{
    priority_queue<pll, vector<pll>, greater<pll> >q;
    q.push(pll (0,1));// 距离 位置
    while(!q.empty())
    {
        pll temp = q.top(); q.pop();
        int x = temp.second, ss = temp.first;
        if(dis[x]!= ss)
           continue;
        for(int i = 0; i < G[x].size(); i++)
        {
            int y = G[x][i].next, d = G[x][i].s;
            if( dis[y] > dis[x] + d)
            {
                dis[y]= dis[x]+d;
                q.push(pll (dis[y],y));
            }
        }
    }
}
void init(int n)
{
    for(int i = 1; i <= n; i++)
        {
            dis[i] = INF;
            G[i].clear();
        }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    while(cin >> n >> m, n+m)
    {
        init(n);
        int x, y, d;
        for(int i = 1; i <= m; i++)
        {
            cin >> x >> y >> d;
            G[x].push_back(Node(y,d));
            G[y].push_back(Node(x,d));
        }
        dis[1] = 0;
        dijkstra();
        cout << dis[n] << endl;
    }
    return 0;
}