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/
aboutsummaryrefslogtreecommitdiffstats
path: root/devel/sourcenav
Commit message (Expand)AuthorAgeFilesLines
* - Update to 6.0gahr2008-09-235-202/+279
* - Fix PLISTgahr2008-06-034-1458/+437
* - Update to 5.2b2gahr2008-06-025-59/+40
* - Bump PORTREVISION (forgot in the previous commit)miwi2008-03-221-1/+1
* - Fix buidmiwi2008-03-221-2/+3
* - Update Tcl/Tk dependenceis to 8.4gahr2008-03-201-6/+4
* Migration from bison 1.x to 2.xade2007-10-171-2/+2