hdu2544---最短路解题报告（Dijkstra算法---vector邻接表+优先队列实现）

版权声明：转载请注明出处:https://blog.csdn.net/qq1013459920 https://blog.csdn.net/qq1013459920/article/details/83756753

                                                      最短路

#include<iostream>
#include<sstream>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<list>
#define mod 1000000007
#define INF 0x3f3f3f3f
#define y1 AC
#define Min 0xc0c0c0c0
#define mst(a) memset(a,0,sizeof(a))
#define f(i,a,b) for(int i = a; i < b; i++)
using namespace std;
const double pi = acos(-1);
const int MAX_N = 1e5 + 5;
const double eps = 1e-8;
typedef long long ll;
int n, m;
int d[105];
bool vis[105];
struct Edge{
    int u, v, t;
    Edge(int u, int v, int t):u(u), v(v), t(t){}
};
struct Node{
    int d, u;
    Node(int d,int u):d(d),u(u) {}
    bool operator <(const Node &rhs)const
    {
        return d > rhs.d;
    }

};
vector<Edge>edge;
vector<int> G[105];
void init(){
    for(int i = 0; i <= n; i++){
        G[i].clear();
        vis[i] = false;
        d[i] = INF;
    }
    edge.clear();
}
void Dijkstra(){
    priority_queue<Node, vector<Node>, less<Node> > pq;
    //fill(d, d + n, INF);
    d[0] = 0;
    pq.push(Node(0, 0));
    while(!pq.empty()){
        Node p = pq.top();
        pq.pop();
        int u = p.u;
        //if(d[u] < p.)  continue;
        //res += p.first;
        if(vis[u])  continue;
        vis[u] = true;;
        for(int i = 0; i < G[u].size(); i++){
            Edge e = edge[G[u][i]];
            if(d[e.v] > d[u] + e.t){
                d[e.v] = d[u] + e.t;
                pq.push(Node(d[e.v], e.v));
            }
        }
    }
}
int main(){
    //double x, y;
    while(scanf("%d%d", &n, &m) != EOF){
        if(n == 0 && m == 0){
            break;
        }
        init();
        for(int i = 1; i <= m; i++){
            int u, v, t;
            scanf("%d%d%d", &u, &v, &t);
            edge.push_back(Edge(u - 1, v - 1, t));
            G[u - 1].push_back(edge.size() - 1);
            edge.push_back(Edge(v - 1, u - 1, t));
            G[v - 1].push_back(edge.size() - 1);
       }
       Dijkstra();
       printf("%d\n", d[n - 1]);
    }
    return 0;