BSD Portsdevel/rubygem-lazy_priority_queue 0.1.1 DragonFly
Priority queue implemented using a lazy binomial heap
- System
- DragonFly
- Repository
- DPorts
- Maintainer
- [email protected] (as in FreeBSD)
- License
- BSD2CLAUSE
- Categories
- devel, rubygems
- Package size
- 2.6 KiB, 5.3 KiB installed
Description
Lazy priority queue is a pure Ruby 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.
In the other systems
| System | Port | Version |
|---|---|---|
| DragonFly | devel/rubygem-lazy_priority_queue | 0.1.1 |
| FreeBSD | devel/rubygem-lazy_priority_queue | 0.1.1 |
Install
Binary package:
pkg install rubygem-lazy_priority_queueFrom DPorts:
cd /usr/dports/devel/rubygem-lazy_priority_queue && make install cleanDependencies
Run dependencies 2
No port depends on this one.