BETAmodules.com is in beta — open to partnerships & joint ventures.Build with us
modules.com
⌘K

lazy_priority_queue

v0.1.1RubyGems· Ruby

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.

The verdict
Abandoned. Last published 10 years ago. No recent activity — look for a maintained alternative.
No recent activity — look for a maintained alternative.
Live from the RubyGems registry · derived rules, not AI
How it scores
MaintenanceAbandoned
PopularityNiche
SecurityClean
LicenseOther
DepsZero deps
Maintenance
Last published 10 years ago.
Popularity
3.0K downloads / week
Security
No known advisories for this version (OSV).
License
non-standard
Dependencies
No runtime dependencies
Recent releases
  • 0.1.110 years ago
  • 0.1.010 years ago
  • 0.0.010 years ago
lazy_priority_queue — 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. (Ruby / RubyGems) · Modules