-
-
28 Apr 2007 18:19:57 UTC
- Distribution: Heap
- Module version: 0.80
- Source (raw)
- Browse (raw)
- Changes
- How to Contribute
- Issues (5)
- Testers (11599 / 5 / 0)
- Kwalitee
Bus factor: 0- 56.52% Coverage
- License: unknown
- Activity
24 month- Tools
- Download (15.31KB)
- MetaCPAN Explorer
- Permissions
- Subscribe to distribution
- Permalinks
- This version
- Latest version
++ed by:2 non-PAUSE users- Dependencies
- Test::Simple
- and possibly others
- Reverse dependencies
- CPAN Testers List
- Dependency graph
NAME
Heap::Fibonacci - a fibonacci heap to keep data partially sorted
SYNOPSIS
use Heap::Fibonacci; $heap = Heap::Fibonacci->new; # see Heap(3) for usage
DESCRIPTION
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.
AUTHOR
John Macdonald, john@perlwolf.com
COPYRIGHT
Copyright 1998-2007, O'Reilly & Associates.
This code is distributed under the same copyright terms as perl itself.
SEE ALSO
Heap(3), Heap::Elem(3).
Module Install Instructions
To install Heap, copy and paste the appropriate command in to your terminal.
cpanm Heap
perl -MCPAN -e shell install Heap
For more information on module installation, please visit the detailed CPAN module installation guide.