迪杰特斯拉算法的推广,用优先队列维护当前最短距离
#include <stdio.h>
#include <vector>
#include <queue>
using namespace std;
#define MAX_V 5005
#define INF 0x7FFFFFFF
typedef int TO_POINT;
typedef int PATH_LEN;
typedef struct edge{
TO_POINT to;
PATH_LEN len;
edge(int to, int len){
this->to = to;
this->len = len;
}
}edge;
typedef struct edge path;
//边的小顶堆排序函数
bool operator < (const path &p1, const path &p2){
return p1.len > p2.len;
}
vector<edge> G[MAX_V]; //记录整个无向无环图
int dis1[MAX_V]; //最短路
int dis2[MAX_V]; //次短路
void solve(int V, int E){
int i, len, v, d2, t;
priority_queue<path> pq;
for(i=1; i<=V; i++){
dis1[i] = dis2[i] = INF;
}
dis1[1] = 0;
pq.push(path(1, 0));
while(!pq.empty()){
v = pq.top().to;
len = pq.top().len;
pq.pop();
if(len > dis2[v]) //滤掉旧的入队数值
continue;
//遍历和v相连的所有的节点
for(i=0; i<G[v].size(); i++){
d2 = len + G[v][i].len;
if(d2 < dis1[G[v][i].to]){
//如果能够更新最短路的话就更新最短路,同时得到新的次短路
t = d2;
d2 = dis1[G[v][i].to];
dis1[G[v][i].to] = t;
pq.push(path(G[v][i].to, dis1[G[v][i].to])); //最短路入队
}
if(d2>dis1[G[v][i].to] && d2<dis2[G[v][i].to]){
//用新的次短路更新次短路
dis2[G[v][i].to] = d2;
pq.push(path(G[v][i].to, dis2[G[v][i].to])); //次短路入队
}
}
}
printf("%d\n", dis2[V]);
}
int main(void){
int V, E, i;
int v1, v2, len;
//freopen("input.dat", "r", stdin);
while(scanf("%d %d", &V, &E) != EOF){
for(i=1; i<=V; i++) G[i].clear();
for(i=1; i<=E; i++){
scanf("%d %d %d", &v1, &v2, &len);
G[v1].push_back(edge(v2, len));
G[v2].push_back(edge(v1, len));
}
solve(V, E);
}
return 0;
}