HDU 2544 最短路 (Dijkstra)

                                                  最短路     

在每年的校赛里，所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候，却是非常累的！所以现在他们想要寻找最短的从商店到赛场的路线，你可以帮助他们吗？ 
 

Input

输入包括多组数据。每组数据第一行是两个整数N、M（N<=100，M<=10000），N表示成都的大街上有几个路口，标号为1的路口是商店所在地，标号为N的路口是赛场所在地，M则表示在成都有几条路。N=M=0表示输入结束。接下来M行，每行包括3个整数A，B，C（1<=A,B<=N,1<=C<=1000）,表示在路口A与路口B之间有一条路，我们的工作人员需要C分钟的时间走过这条路。 
输入保证至少存在1条商店到赛场的路线。 

Output

对于每组输入，输出一行，表示工作人员从商店走到赛场的最短时间

Sample Input

2 1
1 2 3
3 3
1 2 5
2 3 5
3 1 2
0 0

Sample Output

3
2

裸Dijkstra模板

经典写法：

#include <iostream>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#define Mod 1000000007
#define INF 0x3f3f3f3f
typedef long long ll;
using namespace std;
static const int MAX_N = 4005;
int n, m;
int dis[105];
int path[105][105];
bool vis[105];
void init() {	//初始化
	for (int i = 1; i <= n; i++) {
		dis[i] = INF;
		vis[i] = false;
		for (int j = 1; j <= n; j++) {
			path[i][j] = (i == j ? 0 : INF);
		}
	}
}
void Dijkstra() {
	dis[1] = 0;
	vis[1] = true;
	for (int i = 2; i <= n; i++) {
		dis[i] = path[1][i];
	}
	dis[0] = INF;
	for (int i = 1; i <= n; i++) {
		int next = 0;
		for (int j = 1; j <= n; j++) {
			if (!vis[j] && dis[j] < dis[next]) {
				next = j;
			}
		}
		if (next == 0) break;
		vis[next] = true;
		for (int j = 1; j <= n; j++) {	//节点拓展
			if (!vis[j]) {
				dis[j] = min(dis[j], dis[next] + path[next][j]);
			}
		}
	}
	printf("%d\n", dis[n]);
}
int main() {
	while (scanf("%d%d", &n, &m) != EOF) {
		if (n == 0 && m == 0) break;
		init();
		for (int i = 0; i < m; i++) {
			int u, v, w;
			scanf("%d%d%d", &u, &v, &w);
			path[u][v] = path[v][u] = min(path[u][v], w);	//防重边
		}
		Dijkstra();
	}
}

数据结构写法：

#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;