ba2f73992d
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.
6 lines
438 B
Text
6 lines
438 B
Text
$NetBSD: distinfo,v 1.1 2016/10/10 23:15:34 taca Exp $
|
|
|
|
SHA1 (lazy_priority_queue-0.1.1.gem) = 84ae44853d56689cae724ecf1535e7cb1a3b3c21
|
|
RMD160 (lazy_priority_queue-0.1.1.gem) = 82d3053463fa936233e452be781daef441304073
|
|
SHA512 (lazy_priority_queue-0.1.1.gem) = b0f4390d9691cdb1342d428505f5cab69de584cbd734e7a6bc8a4b8b723420c38d7b5bbb7bed4612045360b4f8d8db6e6a8eca8c8e588a43468d4b340844c827
|
|
Size (lazy_priority_queue-0.1.1.gem) = 5632 bytes
|