binomial-heap
Binomial-heap is an implementation of the binomial heap data structure. Insertion, extremum access, extremum extraction, and union operations can be performed on the data structure in O(logn) time.

For further information, please see the README file.

ASDF-install package (obsolete) http://www.students.itu.edu.tr/~yazicivo/files/binomial-heap.tar.gz (Tarball comes with the latest .git source tree. Feel free to play with it.)