Heap::Fibonacci(3pm)

Heap::Fibonacci3pm

A fibonacci heap to keep data partially sorted

Usage

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

Overview

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.

Releases

11 releases since Debian 3.1 (Sarge); the text changed 4 times.

  1. 3.1
  2. 4.0
  3. 5.0–8
  4. 9–11
  5. 12–13

Author

John Macdonald, [email protected]

From libheap-perl 0.80-5 in Debian 13 (Trixie). Parsed by carta from the page's man source.