-
求到顶点v的次短路时,有两种情况,要么是到其他某个顶点u的最短路再加上u->v的边,要么是到某个顶点u的次短路再加上u->v的边。 一般我们用Dijkstra求得最短路(无负权边),由此我们只要在Dijkstra算法中求取每个顶点的次短路即可。
#include <stdio.h>
#include <stdarg.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <vector>
#include <list>
#include <set>
#include <utility>
#include <map>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <fstream>
#include <bitset>
using namespace std;
#define INF 0x3f3f3f
const int N = 300010;
int V, E, a, b, d;
int cnt;
int head[N], dis1[N], dis2[N];
struct ed
{
int to, ne, w;
}e[N<<4];
struct node
{
int x, dis;
bool operator < (const node a) const {return a.dis < dis;}
};
void add(int u, int v, int w)
{
e[cnt].to = v;
e[cnt].ne = head[u];
e[cnt].w = w;
head[u] = cnt++;
}
void dij()
{
priority_queue<node>q;
dis1[0] = 0;
q.push({0,0});
while(!q.empty()) {
node p = q.top(); q.pop();
int u = p.x;
for(int i = head[u]; i+1; i = e[i].ne) {
int v = e[i].to;
int len = p.dis+e[i].w;
if(dis1[v]>len) {
dis2[v] = dis1[v];
dis1[v] = len;
q.push({v,dis1[v]});
}else if(dis2[v]>len&&dis1[v]<len) {
dis2[v] = len;
q.push({v,dis2[v]});
}
}
}
}
int main()
{
cnt = 0;
memset(head,-1,sizeof(head));
memset(dis1,INF,sizeof(dis1));
memset(dis2,INF,sizeof(dis2));
scanf("%d %d", &V, &E);
for(int i = 0; i < E; i++) {
scanf("%d %d %d", &a, &b, &d);
add(a,b,d);
add(b,a,d);
}
dij();
printf("%d\n", dis2[V-1]);
return 0;
}