next数组和邻接表数组邻接表实现分别实现的spfa(p1090).docVIP

next数组和邻接表数组邻接表实现分别实现的spfa(p1090) {next 数组} const maxn=maxlongint div 2; var u,v,w,dist,next:array[1..100000]of longint; d:array[1..5000000]of integer; can:array[1..100000]of boolean; point:array[1..10000]of longint; m,n,i,j,k,s,t:longint; now,head,tail,mp:longint; procedure spfa(s:integer); begin fillchar(can,sizeof(can),false); fillchar(d,sizeof(d),0); for i:=1 to n do dist[i]:=maxn; head:=0;tail:=1; can[s]:=true; dist[s]:=0; d[1]:=s; while headtail do begin inc(head); now:=d[head]; mp:=point[now]; while mp0 do begin if dist[v[mp]](dist[now]+w[mp]) then begin dist[v[mp]]:=dist[now]+w[mp]; if not can[v[mp]] then begin inc(tail); d[tail]:=v[mp]; can[v[mp]]:=true; end; end; mp:=next[mp]; end; can[now]:=false; end; if dist[t]maxn then writeln(dist[t]) else writeln(No Solution!); end; begin read(n,m); for i:=1 to m do begin read(u[i],v[i],w[i]); next[i]:=point[u[i]]; point[u[i]]:=i; end; read(s,t); spfa(s); end. {邻接表 program net; type pointer=^node; node=record v,e:longint; next:pointer; end; var n,m,i,x,y,d,s,t,head,tail:longint; p,tmp:pointer; q:array[1..500000]of longint; dist:array[1..11000]of longint; map:array[1..10000]of pointer; procedure spfa; var b:array[1..10000]of boolean; begin fillchar(b,sizeof(b),false); q[head]:=s; b[s]:=true; dist[s]:=0; repeat tmp:=map[q[head]]; while tmpnil do begin if dist[tmp^.v]tmp^.e+dist[q[head]] then begin dist[tmp^.v]:=tmp^.e+dist[q[head]]; if b[tmp^.v]=false then begin inc(tail); q[tail]:=tmp^.v; b[tmp^.v]:=true; end; end; tmp:=tmp^.next; end; b[q[head]]:=false; inc(head); until headtail; if dist[t]maxlongint div 2 t