①处应填()
dist[1]=1
dist[n]=1
dist[1]=-1
dist[1]=0
②处应填()
dist[point[x]]+weight[j]<dist[x]
dist[j]+weight[x]<dist[point[x]]
dist[x]+weight[j]<dist[point[j]]
dist[x]+weight[point[j]]<dist[j]
③处应填()
t--
visit[x]=0
point[j]=j
nxt[j]=point[j]
④处应填()
dist[x]+weight[j]--dist[point[j]]
dist[x]+weight[point[j]]==dist[point[j]]
dist[x]+weight[point[j]]==dist[point[x]]
dist[point[x]]+weight[point[j]]==dist[point[j]]
⑤处应填()
visit[point[j]]=0
visit[point[j]]=0
visit[queue[t]]=1
visit[point[j]]=1
发表评论