【计算机考研机试指南】第十一章 图论：单源最短路径——畅通工程续_浙大

#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
#include <queue>
#include <climits>

using namespace std;

const int MAXN = 200;
const int INF = INT_MAX;

struct Edge{
	int to;
	int length;
	Edge(int t, int l): to(t), length(l){
	}
};

struct Point{
	int number;
	int distance;
	Point(int n, int d): number(n), distance(d){
	}
	bool operator< (const Point& p) const{
		return distance > p.distance;	//距离小优先级高 
	}
};

vector<Edge> graph[MAXN];	//邻接表实现图 
int dis[MAXN];	//原调到各点距离 

void Dijkstra(int s){
	priority_queue<Point> mpq;
	dis[s] = 0;
	mpq.push(Point(s, dis[s]));
	
	while(!mpq.empty()){
		int u = mpq.top().number;	//离源点最近的点
		mpq.pop();
		for(int i = 0; i < graph[u].size(); i++){
			int v = graph[u][i].to;
			int d = graph[u][i].length;
			if(dis[v] > dis[u]+d){
				dis[v] = dis[u] + d;
				mpq.push(Point(v, dis[v]));
			}
		} 
	}
	return;
} 
int main(int argc, char** argv) {
	int n, m;
	while(scanf("%d%d", &n, &m) != EOF){
		memset(graph, 0, sizeof(graph))	;	//初始化图
		fill(dis, dis+n, INF); 				//距离初始化为无穷
		
		while(m--){
			int from, to, length;
			scanf("%d %d %d", &from, &to, &length);
			graph[from].push_back(Edge(to, length));
			graph[to].push_back(Edge(from, length)); 
		} 
		int s, t;
		scanf("%d %d", &s, &t);
		Dijkstra(s);
		if(dis[t] == INF){
			dis[t] = -1;
		}
		printf("%d\n", dis[t]);
	}
	return 0;
}