Heap::Binomial.3pm

Langue: en

Autres versions - même langue

Version: 2007-10-23 (debian - 07/07/09)

Section: 3 (Bibliothèques de fonctions)

Sommaire

NAME

Heap::Binomial - a binomial heap to keep data partially sorted

SYNOPSIS

   use Heap::Binomial;
 
 

   $heap = Heap::Binomial->new;
   # see Heap(3) for usage

DESCRIPTION

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.

AUTHOR

John Macdonald, john@perlwolf.com Copyright 1998-2007, O'Reilly & Associates.

This code is distributed under the same copyright terms as perl itself.

SEE ALSO

Heap(3), Heap::Elem(3).