Popularity
0.5
Declining
Activity
2.2
Declining
8
2
0

Description

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.

Programming language: Ruby
License: MIT License

PairingHeap alternatives and similar gems

Based on the "Data analysis/structures" category.
Alternatively, view pairing_heap alternatives based on common mentions on social networks and blogs.

Do you think we are missing an alternative of PairingHeap or a related project?

Add another 'Data analysis/structures' Gem