Now
MAIN commitmail json YAML
pkgsrc/devel/ruby-lazy_priority_queue/DESCR@1.1
/
diff
pkgsrc/devel/ruby-lazy_priority_queue/Makefile@1.1 / diff
pkgsrc/devel/ruby-lazy_priority_queue/PLIST@1.1 / diff
pkgsrc/devel/ruby-lazy_priority_queue/distinfo@1.1 / diff
pkgsrc/devel/ruby-lazy_priority_queue/Makefile@1.1 / diff
pkgsrc/devel/ruby-lazy_priority_queue/PLIST@1.1 / diff
pkgsrc/devel/ruby-lazy_priority_queue/distinfo@1.1 / diff
Add ruby-lazy_priority_queue 0.1.1, required by ruby-rgl.
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.
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.