./devel/ruby-pairing_heap, Performant priority queue in pure ruby

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

Branch: CURRENT, Version: 3.1.0, Package name: ruby32-pairing_heap-3.1.0, Maintainer: pkgsrc-users

PairingHeap

PairingHeap is a pure Ruby priority queue implementation using a pairing
heap as the underlying data structure. While a pairing heap is
asymptotically less efficient than the Fibonacci heap, it is usually faster
in practice. This makes it a popular choice for Prim's MST or Dijkstra's
algorithm implementations.

PairingHeap is currently being used as the priority queue data structure in
RGL (https://github.com/monora/rgl/).

Also implementation without priority change support is provided
(SimplePairingHeap), while the asymptotical complexity of the methods stay
the same, bookkeeping of elements is not needed making, the constant
smaller.

Master sites:

Filesize: 14 KB

Version history: (Expand)

CVS history: (Expand)


   2024-02-12 15:59:23 by Takahiro Kambe | Files touched by this commit (2) | Package updated
Log message:
devel/ruby-pairing_heap: update to 3.1.0

3.1.0 (2024-02-12)

* Implement merge operation for SimplePairingHeap
   2023-04-27 16:05:26 by Takahiro Kambe | Files touched by this commit (2) | Package updated
Log message:
devel/ruby-pairing_heap: update to 3.0.1

3.0.1 (2023-04-09)

Fixed issues

* change_priority could sometimes return nil instead of self
   2023-02-23 15:55:01 by Takahiro Kambe | Files touched by this commit (4) 
Log message:
devel/ruby-pairing_heap: add version 3.0.0

This pacakges is required by new version of ruby-rgl package.

PairingHeap

PairingHeap is a pure Ruby priority queue implementation using a pairing
heap as the underlying data structure.  While a pairing heap is
asymptotically less efficient than the Fibonacci heap, it is usually faster
in practice.  This makes it a popular choice for Prim's MST or Dijkstra's
algorithm implementations.

PairingHeap is currently being used as the priority queue data structure in
RGL (https://github.com/monora/rgl/).

Also implementation without priority change support is provided
(SimplePairingHeap), while the asymptotical complexity of the methods stay
the same, bookkeeping of elements is not needed making, the constant
smaller.