./devel/ruby-lazy_priority_queue, Priority queue implemented using a lazy binomial heap

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: pkgsrc-2020Q4, Version: 0.1.1, Package name: ruby26-lazy_priority_queue-0.1.1, Maintainer: pkgsrc-users

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.

Master sites:

SHA1: 84ae44853d56689cae724ecf1535e7cb1a3b3c21
RMD160: 82d3053463fa936233e452be781daef441304073
Filesize: 5.5 KB

Version history: (Expand)