1Heap::Fibonacci(3)    User Contributed Perl Documentation   Heap::Fibonacci(3)
2
3
4

NAME

6       Heap::Fibonacci - a fibonacci heap to keep data partially sorted
7

SYNOPSIS

9         use Heap::Fibonacci;
10
11         $heap = Heap::Fibonacci->new;
12         # see Heap(3) for usage
13

DESCRIPTION

15       Keeps elements in heap order using a linked list of Fibonacci trees.
16       The heap method of an element is used to store a reference to the node
17       in the list that refers to the element.
18
19       See Heap for details on using this module.
20

AUTHOR

22       John Macdonald, john@perlwolf.com
23

25       Copyright 1998-2007, O'Reilly & Associates.
26
27       This code is distributed under the same copyright terms as perl itself.
28

SEE ALSO

30       Heap(3), Heap::Elem(3).
31
32
33
34perl v5.38.0                      2023-07-20                Heap::Fibonacci(3)
Impressum