Heap::Fibonacci - a fibonacci heap to keep data partially sorted
use Heap::Fibonacci;
$heap = Heap::Fibonacci->new;
# see Heap(3) for usage
Keeps elements in heap order using a linked list of Fibonacci 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.
John Macdonald, john@perlwolf.com
Copyright 1998-2007, O'Reilly & Associates.
This code is distributed under the same copyright terms as perl itself.
Heap(3), Heap::Elem(3).
|