|
|
Heap::Elem::NumRev - Reversed Numeric Heap Elements
use Heap::Elem::NumRev( NumRElem ); use Heap::Fibonacci;
my $heap = Heap::Fibonacci->new; my $elem;
foreach $i ( 1..100 ) { $elem = NumRElem( $i ); $heap->add( $elem ); }
while( defined( $elem = $heap->extract_top ) ) { print "Largest is ", $elem->val, "\n"; }
Heap::Elem::NumRev is used to wrap numeric values into an element that can be managed on a heap. The top of the heap will have the largest element still remaining. (See the Heap::Elem::Num manpage if you want the heap to always return the smallest element.)
The details of the Elem interface are described in the Heap::Elem manpage.
The details of using a Heap interface are described in the Heap manpage.
John Macdonald, john@perlwolf.com
Copyright 1998-2007, O'Reilly & Associates.
This code is distributed under the same copyright terms as perl itself.
Heap(3), Heap::Elem(3), Heap::Elem::Num(3).