lazy_priority_queue
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.
Activity
- Latest release
- 10y ago
- Total releases
- 3
- Cadence
- ~43 days
- Last 12 months
- 0
Details
- License
- unknown
- First release
- Jan 11, 2016
Releases
| Version | Released | |
|---|---|---|
0.1.1
patch
| ||
0.1.0
minor
| ||
0.0.0
initial
|