The Fibonacci heap has interesting run time constraints, with many operations occuring in constant or amortised constant time, making it ideal for use in implementing other algorithms, such as Dijkstra's shortest path and Prim's minimum spanning tree algorithms.
CL-HEAP is licensed under the GPL. Its web page can be found at http://common-lisp.net/project/cl-heap/.
Download ASDF package from http://common-lisp.net/project/cl-heap/releases/cl-heap_0.1.4.tar.gz
CLiki pages can be edited by anyone at any time. Imagine a fearsomely comprehensive disclaimer of liability. Now fear, comprehensively