File: [cvs.NetBSD.org] / pkgsrc / devel / ruby-priority-queue / PLIST (download)
Revision 1.1.1.1 (vendor branch), Wed May 3 05:17:48 2006 UTC (17 years, 11 months ago) by minskim
Branch: TNF
CVS Tags: pkgsrc-base, pkgsrc-2008Q1-base, pkgsrc-2008Q1, pkgsrc-2007Q4-base, pkgsrc-2007Q4, pkgsrc-2007Q3-base, pkgsrc-2007Q3, pkgsrc-2007Q2-base, pkgsrc-2007Q2, pkgsrc-2007Q1-base, pkgsrc-2007Q1, pkgsrc-2006Q4-base, pkgsrc-2006Q4, pkgsrc-2006Q3-base, pkgsrc-2006Q3, pkgsrc-2006Q2-base, pkgsrc-2006Q2 Changes since 1.1: +0 -0
lines
Import ruby-priority-queue.
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.
|