Heap::Binomial3pm
A binomial heap to keep data partially sorted
Usage
use Heap::Binomial;$heap = Heap::Binomial->new;# see Heap(3) for usage
Overview
Keeps elements in heap order using a linked list of binomial trees. The heap method of an element is used to store a reference to the node in the list that refers to the element.
See Heap for details on using this module.
Releases
11 releases since Debian 3.1 (Sarge); the text changed 4 times.