p5-Heap-0.80p2
heap data structure in perl
Back to search · Project homepage
Description
This is a collection of 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
See the book "Algorithms" by Cormen, Leiserson, and Rivest for
details of the three heap packages.
Package information
- Ports path
- devel/p5-Heap
- Package architecture
- *
- Maintainer
- The OpenBSD ports mailing-list <ports@openbsd.org>
- Categories
- devel, perl5
- Available flavors
- None listed
These are ports metadata. Binary availability depends on the release, architecture and mirror. Build and test dependencies are not an installation checklist.
Direct dependencies
None listed in sqlports.
Used by (4 dependency relationships)
Includes library, runtime, build and test relationships. Results load 100 at a time.