lazy_priority_queue (0.0.0)

Matías Battocchia
2016-01-11T20:17:03Z

Lazy priority queue is 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.