|
Heap::Binomial - a Perl extension for keeping data partially sorted |
Heap::Binomial - a Perl extension for keeping data partially sorted
use Heap::Binomial;
$heap = Heap::Binomial->new; # see Heap(3) for usage
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 the Heap manpage for details on using this module.
John Macdonald, jmm@elegant.com
Copyright 1998, O'Reilly & Associates.
This code is distributed under the sme copyright as perl itself.
Heap(3), Heap::Elem(3).
|
Heap::Binomial - a Perl extension for keeping data partially sorted |