This module implements efficient priority-queues using fibonnaci heaps. While for many purpose this is not as efficient as the more-common binomial heaps, it is very efficient in some aspects that make it very useful for traversal of very large graph structures. WWW: http://www.csse.monash.edu.au/hons/projects/1999/Andrew.Snare/ ='application/atom+xml'/>
aboutsummaryrefslogtreecommitdiffstats
path: root/audio/linux-f8-alsa-lib
Commit message (Expand)AuthorAgeFilesLines
* o change default linux package at bsd.linux-rpm.mk for automaticbsam2006-07-132-11/+10
* bsd.linux-rpm.mk:netchild2006-05-012-5/+9
* Fix MASTER_SITE_SUBDIRjylefort2006-01-311-1/+1
* Switch to the USE_LINUX_RPM framework.jylefort2006-01-221-3/+4
* The linuxulator does not support Linux amd64 code. When ${ARCH} isjylefort2005-11-292-3/+1