9f18761b19
This is a fibonacci-heap priority-queue implementation. This project is different from K. Kodamas PQueue in that it allows a decrease key operation. That makes PriorityQueue usable for algorithms like dijkstras shortest path algorithm, while PQueue is more suitable for Heapsort and the like.
8 lines
426 B
Text
8 lines
426 B
Text
@comment $NetBSD: PLIST,v 1.1.1.1 2006/05/03 05:17:48 minskim Exp $
|
|
${RUBY_SITEARCHLIBDIR}/priority_queue/CPriorityQueue.${RUBY_DLEXT}
|
|
${RUBY_SITELIBDIR}/priority_queue.rb
|
|
${RUBY_SITELIBDIR}/priority_queue/c_priority_queue.rb
|
|
${RUBY_SITELIBDIR}/priority_queue/poor_priority_queue.rb
|
|
${RUBY_SITELIBDIR}/priority_queue/ruby_priority_queue.rb
|
|
@dirrm ${RUBY_SITELIBDIR}/priority_queue
|
|
@dirrm ${RUBY_SITEARCHLIBDIR}/priority_queue
|