hdoj 2544 最短路

和上一题一样也是纯的最短路

/*
PROG:
LANG: C++11 
*/
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <climits>
#include <ctype.h>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <deque>
#include <set>
#include <map>
#include <iostream>
#include <fstream>
#include <algorithm>
#include <time.h>

using namespace std;
#define mst(a,b) memset(a,b,sizeof(a))

typedef long long ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
const int INF = 0x7fffffff;
const int MAXN = 101;

struct edge{ int to, cost;};
vector<edge> G[MAXN];
int d[MAXN];
int V, E;
int a,b,c;

void solve(){
    mst(d,0);
    fill(d,d+MAXN,INF);
    priority_queue<P, vector<P>, greater<P> > q;
    d[1] = 0;
    q.push(P(0,1));

    while(!q.empty()){
        P p = q.top();
        q.pop();
        int v = p.second;
        int dd = p.first;
        if(d[v] < dd)
            continue;
        for(int i = 0; i < G[v].size(); i++){
            edge e = G[v][i];
            if(d[e.to] > dd + e.cost){
                d[e.to] = dd + e.cost;
                q.push(P(d[e.to],e.to));
            }
        }
    }
    // node V
    printf("%d\n",d[V]);
}

int main()
{
    while(scanf("%d%d", &V, &E) != EOF){
        if(V == 0 && E == 0)
            break;
        for(int i = 0; i < MAXN; i++)
            G[i].clear();
        for(int i = 0; i < E; i++){
            scanf("%d%d%d", &a, &b, &c);
            edge e1, e2;
            e1.to = a; e1.cost = c;
            e2.to = b; e2.cost = c;
            G[a].push_back(e2);
            G[b].push_back(e1);
        }
        solve();

    }
    return 0;
}