题目链接:http://poj.org/problem?id=2449
题解:
A*求k短路模板题…
反向SPFA,dis数组为估价函数,当目标点的更新次数达到k时,就求出了广义上的k短路
//by sdfzchy
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long LL;
const int N=1010;
const int M=100010;
int n,m,ecnt,head[N],hhead[N],s,t,k;
struct E
{
int to,dis,nxt;
}e[M],ee[M];
void add_edge(int u,int v,int w)
{
++ecnt;
e[ecnt]=(E){v,w,head[u]};
head[u]=ecnt;
ee[ecnt]=(E){u,w,hhead[v]};
hhead[v]=ecnt;
}
int dis[N];
bool vis[N];
void spfa()
{
queue<int> q;
memset(dis,0x7f,sizeof(dis));
dis[t]=0,vis[t]=1;
q.push(t);
while(!q.empty())
{
int u=q.front();
q.pop();
vis[u]=0;
for(int i=hhead[u];i;i=ee[i].nxt)
{
int v=ee[i].to;
if(dis[u]+ee[i].dis<dis[v])
{
dis[v]=dis[u]+ee[i].dis;
if(!vis[v]) vis[v]=1,q.push(v);
}
}
}
}
struct A
{
int point,h,g;
bool operator <(const A& x)const
{
return h+g>x.h+x.g;
}
};
int A_star()
{
int cnt=0;
priority_queue<A>Q;
if(s==t) k++;
Q.push((A){s,dis[s],0});
while(!Q.empty())
{
A u=Q.top();
Q.pop();
if(u.point==t) if(++cnt==k) return u.g;
for(int i=head[u.point];i;i=e[i].nxt)
Q.push((A){e[i].to,dis[e[i].to],u.g+e[i].dis});
}
return -1;
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1,u,v,w;i<=m;i++)
{
scanf("%d%d%d",&u,&v,&w);
add_edge(u,v,w);
}
scanf("%d%d%d",&s,&t,&k);
spfa();
printf("%d\n",A_star());
return 0;
}