Rechercher une page de manuel
Heap::Binomial.3pm
Langue: en
Version: 2007-10-23 (debian - 07/07/09)
Section: 3 (Bibliothèques de fonctions)
NAME
Heap::Binomial - a binomial heap to keep data partially sortedSYNOPSIS
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.comCOPYRIGHT
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).Contenus ©2006-2024 Benjamin Poulain
Design ©2006-2024 Maxime Vantorre