71c877109e
This is a collection of perl routines for managing a heap data structure.
There are two major components: a heap component, and an element
component.
A heap package basically keeps a collection of elements and is
able to return the smallest one.
The heap component interface is defined in Heap(3) and must be
supported by all heap packages. Currently there are three heap
components provided:
Heap::Fibonacci (the preferred one)
Heap::Binomial
Heap::Binary
14 lines
474 B
Text
14 lines
474 B
Text
This is a collection of perl routines for managing a heap data structure.
|
|
There are two major components: a heap component, and an element
|
|
component.
|
|
|
|
A heap package basically keeps a collection of elements and is
|
|
able to return the smallest one.
|
|
|
|
The heap component interface is defined in Heap(3) and must be
|
|
supported by all heap packages. Currently there are three heap
|
|
components provided:
|
|
|
|
Heap::Fibonacci (the preferred one)
|
|
Heap::Binomial
|
|
Heap::Binary
|