ba2f73992d
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.
4 lines
183 B
Text
4 lines
183 B
Text
@comment $NetBSD: PLIST,v 1.1 2016/10/10 23:15:34 taca Exp $
|
|
${GEM_HOME}/cache/${GEM_NAME}.gem
|
|
${GEM_LIBDIR}/lib/lazy_priority_queue.rb
|
|
${GEM_HOME}/specifications/${GEM_NAME}.gemspec
|