Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- dijkstra:
- //something before
- dist ← -1
- while !queue.empty()
- T=queue.top().dest, W=queue.top().dest
- dist[T]=W
- for_each edge
- queue.add(edge.dest, W+edge.price)
- while(!queue.empty()&&dist[queue.top().dest]!=-1)
- queue.pop()
Advertisement
Add Comment
Please, Sign In to add comment
