blob: 8cd225ecd98d693a8218761d10a3d1af12d1961d (
plain)
1
2
3
4
|
A priority queue which implements a lazy binomial heap. It supports the
change priority operation, being suitable for algorithms like Dijkstra's
shortest path and Prim's minimum spanning tree. It can be instantiated as a
min-priority queue as well as a max-priority queue.
|
