Dijkstra算法--邻接表存储+堆优化

//Dijkstra
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAX = 5005;
typedef pair<int, int > P;
struct node {
    int to;
    int c;
};
vector<node> G[MAX];
int n,m;
void addedge(int u, int v, int c)
{
    node temp;
    temp.to = v;temp.c = c;
    G[u].push_back(temp);
    temp.to = u;temp.c = c;
    G[v].push_back(temp);
}
void Dijk(int s)
{
    int lowcost[MAX];
    priority_queue<P, vector<P>, greater<P> > q;
    fill(lowcost, lowcost + n, INF);
    lowcost[s] = 0;
    q.push(P(0,s));
    while( !q.empty() )
    {
        P p = q.top(); q.pop();
        int v = p.second;
        if(lowcost[v] < p.first ) continue;
        for(int i = 0; i < G[v].size(); i ++)
        {
            node e = G[v][i];
            if(lowcost[e.to] > lowcost[v] + e.c)
            {
                lowcost[e.to] = lowcost[v] + e.c;
                q.push(P(lowcost[e.to],e.to));
            }
        }
    }
    printf("%d\n",lowcost[n-1]);
}
void Clear()
{
    for(int i = 0; i < n; i ++)
        G[i].clear();
}
int main()
{
    int u, v, c;
    while(scanf("%d %d",&n, &m) != EOF && n|m)
    {
        for(int i = 0; i < m; i ++)
        {
            scanf("%d %d %d",&u, &v, &c);
            u-=1;v-=1;
            addedge(u,v,c);
        }
        Dijk(0);
        Clear();
    }
    return 0;
}