Heap::Binomial - a binomial heap to keep data partially sorted River stage two • 6 direct dependents • 36 total dependents

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....

JMM/Heap-0.80 - 28 Apr 2007 18:19:57 GMT

Heap - Perl extensions for keeping data partially sorted River stage two • 6 direct dependents • 36 total dependents

The Heap collection of modules provide routines that manage a heap of elements. A heap is a partially sorted structure that is always able to easily extract the smallest of the elements in the structure (or the largest if a reversed compare routine i...

JMM/Heap-0.80 - 28 Apr 2007 18:19:57 GMT

Heap::Elem - Base class for elements in a Heap River stage two • 6 direct dependents • 36 total dependents

This is an inheritable class for Heap Elements. It provides the interface documentation and some inheritable methods. Only a child classes can be used - this class is not complete....

JMM/Heap-0.80 - 28 Apr 2007 18:19:57 GMT

3 results (0.033 seconds)