NAME Heap::Binomial - a binomial heap to keep data partially sorted SYNOPSIS use Heap::Binomial; $heap = Heap::Binomial->new; # see Heap(3) for usage DESCRIPTION Keeps elements in heap order using a linked list of binomial 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 AT 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).
Generated by phpMan Author: Che Dong On Apache Under GNU General Public License - MarkDown Format
2026-05-23 06:49 @216.73.217.24 CrawledBy Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)