df948755d7
Lazy priority queue is a pure Ruby 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. WWW: https://github.com/matiasbattocchia/lazy_priority_queue
3 lines
189 B
Text
3 lines
189 B
Text
TIMESTAMP = 1464389841
|
|
SHA256 (rubygem/lazy_priority_queue-0.1.1.gem) = e5d4ea8d037e8743afc91019fc23f5f6858372fea73e05e8244f8964f0634337
|
|
SIZE (rubygem/lazy_priority_queue-0.1.1.gem) = 5632
|