题意:
给出n个点,m条双向边的无向图,询问从1到n的简单路径中,第二短路的长度为多少
题解:
SPFA:用两个dis数组记录,一个记录最短路径,一个记录次短路径,注意最短路径更新时可以更新次短路径,次短路径可以通过最短路径更新,也可以通过次短路径更新
A*:A*求第K短路模板题
AC代码(SPFA双数组):
#pragma GCC optimize(2)
//#include<bits/stdc++.h>
//#include<ext/rope>
#include<iostream>
#include<cstdio>
#include<queue>
using namespace std;
//using namespace __gnu_cxx;
#define LL long long
const int MAXN = 5050;
const int MAXM = 2e5+50;
const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
struct node{ int v,w,nxt; }edge[MAXM];
int n,m,tot,head[MAXN],dis1[MAXN],dis2[MAXN],vis[MAXN];
inline void add(int u,int v,int w){
edge[++tot].v=v; edge[tot].w=w; edge[tot].nxt=head[u]; head[u]=tot;
edge[++tot].v=u; edge[tot].w=w; edge[tot].nxt=head[v]; head[v]=tot;
}
inline void SPFA(){
for(int i=1;i<=n;i++) dis1[i]=dis2[i]=INF,vis[i]=0;
dis1[1]=0,vis[1]=1;
queue<int> que; que.push(1);
while(!que.empty()){
int u=que.front(); que.pop();
vis[u]=0;
for(int i=head[u];i;i=edge[i].nxt){
int v=edge[i].v,w=edge[i].w;
if(dis1[v]>dis1[u]+w){
dis2[v]=dis1[v]; dis1[v]=dis1[u]+w;
if(!vis[v]) vis[v]=1,que.push(v);
}
if(dis1[v]<dis1[u]+w && dis2[v]>dis1[u]+w){
dis2[v]=dis1[u]+w;
if(!vis[v]) vis[v]=1,que.push(v);
}
if(dis2[v]>dis2[u]+w){
dis2[v]=dis2[u]+w;
if(!vis[v]) vis[v]=1,que.push(v);
}
}
}
}
signed main(){
scanf("%d%d",&n,&m);
for(int i=1,u,v,w;i<=m;i++) scanf("%d%d%d",&u,&v,&w),add(u,v,w);
SPFA();
printf("%d\n",dis2[n]);
return 0;
}
AC代码(A*):
#pragma GCC optimize(2)
//#include<bits/stdc++.h>
//#include<ext/rope>
#include<iostream>
#include<cstdio>
#include<queue>
using namespace std;
//using namespace __gnu_cxx;
#define LL long long
const int MAXN = 5050;
const int MAXM = 2e5+50;
const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
struct node{ int v,w,nxt; }edge[MAXM];
int n,m,tot,head[MAXN],dis[MAXN];
struct A_star{
int v,val;
bool operator < (const A_star &x) const{
return x.val+dis[x.v] < val+dis[v];
}
};
inline void add(int u,int v,int w){
edge[++tot].v=v; edge[tot].w=w; edge[tot].nxt=head[u]; head[u]=tot;
edge[++tot].v=u; edge[tot].w=w; edge[tot].nxt=head[v]; head[v]=tot;
}
inline void dijkstra(){
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > que;
for(int i=1;i<=n;i++) dis[i]=INF;
que.push(make_pair(0,n)); dis[n]=0;
while(!que.empty()){
int u=que.top().second; que.pop();
for(int i=head[u];i;i=edge[i].nxt){
int v=edge[i].v,w=edge[i].w;
if(dis[v]>dis[u]+w){
dis[v]=dis[u]+w;
que.push(make_pair(dis[v],v));
}
}
}
}
inline int BFS(){
int kth=0;
priority_queue<A_star> que;
que.push({1,0});
while(!que.empty()){
A_star u=que.top(); que.pop();
if(u.v==n) kth++;
if(kth==2) return u.val;
for(int i=head[u.v];i;i=edge[i].nxt)
que.push({edge[i].v,u.val+edge[i].w});
}
return -1;
}
signed main(){
scanf("%d%d",&n,&m);
for(int i=1,u,v,w;i<=m;i++) scanf("%d%d%d",&u,&v,&w),add(u,v,w);
dijkstra();
printf("%d\n",BFS());
return 0;
}