蓝桥杯算法训练：单源短路径SPFA实现与调试.pdfVIP

C++

/*简单的单源最短路问

题朴素SPFA一组错误、

猜法出错*/

#includeiostream#includestdio.h#

includecmath#includestring#

includequeue#includecstring

usingnamespacestd;constintmaxN

=100000,maxM=300000;intN,m=0,M,

H[maxN],D[maxM],F[maxN]{

};

结构体Edge{intz,y,w;}E[maxM];int

Relax(intw,intm){returnmw?(w

m):0;}voidaddE(intx,inty,intw){E

[++m].y=y;E[m].w=w;E[m].z=H[x];

H[x]=m;}/*voidSPFA(intx){boolF[

maxN]{};队列intQ;inty;for

(memset(D,0x7f,sizeof(D)),D[x]=0

,F[x]=1,Q.push(x);!Q.empty();F[x]=0,Q.pop())