poj2499 Remmarguts' Date 第K短路(spfa+A*)

//poj 2449第K短路
//spfa + A*
#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
using namespace std;
const int N=10100,M=100100;
const int INF=0x3fffffff;
int cnt;
struct Node{
    int u,v,w,next;
}edge[2*M];
int head1[N],head2[N];
void addedge(int u,int v,int w){
    edge[cnt].u=u;edge[cnt].v=v;edge[cnt].w=w;edge[cnt].next=head1[u];
    head1[u]=cnt++;
    edge[cnt].u=v;edge[cnt].v=u;edge[cnt].w=w;edge[cnt].next=head2[v];
    head2[v]=cnt++;
}
int h[N];
void spfa(int u,int n){
    int Q[N];
    int front=0,rear=0;
    int vis[N];
    memset(vis,0,sizeof(vis));
    Q[rear++]=u;vis[u]=1;
    for(int i=0;i<=n;i++)h[i]=INF;
    h[u]=0;
    while(front!=rear){
        int top=Q[front++];vis[top]=0;
        for(int i=head2[top];i!=-1;i=edge[i].next){
            int v=edge[i].v;
            if(h[top]+edge[i].w<h[v]){
                h[v]=h[top]+edge[i].w;
                if(!vis[v])vis[v]=1,Q[rear++]=v;
            }
        }
    }
}
struct node{
    int h,g,n;
    //f=g+h 其中h为启发函数值 h(i)<=h*(i) g为起点到i的代价
    //真实值 h*(i)当前状态到目标状态的最短距离
    bool operator<(const node&A)const{
        return h+g>A.h+A.g;
    }
};
int A_star(int s,int t,int k){
    int vis[N];
    priority_queue<node> q;
    memset(vis, 0, sizeof(vis));
    node a,p;
    a.n=s;a.h=h[s];a.g=0;
    q.push(a);
    if(s==t)k++;//必须要走
    while(!q.empty()){
        a=q.top();q.pop();
        vis[a.n]++;
        if(vis[a.n]>k)continue;
        if(vis[t]==k)return a.g;
        for(int i=head1[a.n];i!=-1;i=edge[i].next){
            p.n=edge[i].v;
            p.g=a.g+edge[i].w;
            p.h=h[p.n];
            q.push(p);
        }
    }
    return -1;
}
void init(){
    cnt=0;
    memset(head1,-1,sizeof(head1));
    memset(head2, -1, sizeof(head2));
}
int main(){
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF){
        init();
        for(int i=0;i<m;i++){
            int u,v,w;
            scanf("%d%d%d",&u,&v,&w);
            addedge(u,v,w);
        }
        int s,t,k;
        scanf("%d%d%d",&s,&t,&k);
        spfa(t,n);
        printf("%d\n",A_star(s,t,k));
    }
    return 0;
}