spfa算法求解图论最短路问题 C++实现

#include<iostream>
#include<cstring>
using namespace std;
const int N=1e5+10;
int h[N],e[N],w[N],ne[N],idx;
int dist[N],q[N];
bool st[N];
int n,m;

void add(int a,int b,int c){
    e[idx] = b;
    w[idx] = c;
    ne[idx] = h[a];
    h[a] = idx++;
}
void spfa(){
    memset(dist,0x3f,sizeof dist);
    dist[1]=0;
    int hh=0,tt=-1;
    q[++tt] = 1;
    st[1]=true;
    while(hh<=tt){
        int t=q[hh++];
        st[t]=false;
        for(int i=h[t];i!=-1;i=ne[i]){
            int j=e[i];
            if(dist[j]>dist[t]+w[i]){
                dist[j]=dist[t]+w[i];
                if(!st[j]){
                    st[j]=true;
                    q[++tt] = j;
                }
            }
        }
    }
}



int main(){
    scanf("%d%d",&n,&m);
    memset(h,-1,sizeof h);
    while(m--){
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        add(a,b,c);
    }
    spfa();
    if(dist[n]==0x3f3f3f3f) puts("impossible");
    else printf("%d",dist[n]);
}