lazy_priority_queue (0.1.1)

Matías Battocchia
2016-04-06T04:53:14Z

A priority queue implemented using a lazy binomial heap. It allows change priority operation.

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.