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.
Required Ruby Version
>= 0
Authors
Matías Battocchia
Versions
-
0.1.1
-
source
- 0.1.1 source April 06, 2016 (5.5 KB)
-
-
0.1.0
-
source
- 0.1.0 source January 12, 2016 (5.5 KB)
-
-
0.0.0
-
source
- 0.0.0 source January 11, 2016 (5.5 KB)
-