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

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

Branch: pkgsrc-2022Q4, Version: 0.1.1, Package name: ruby31-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:

Filesize: 5.5 KB

Version history: (Expand)