----- Original Message -----
From: "Ankit Singla" <iitb.an...@gmail.com>
Hi,
I'm trying to use Fibonacci heaps to keep <key, value> type of objects
sorted. I require the sorting to be over the key. I've only started
out with Perl and can't figure out how to extend the Heap::Elem class
to make this kind of pair objects for use with Heap::Fibonacci. I have
tried reading up the perldocs but it doesn't seem to be a good
starting point for novices like me. Can someone point me to example
code where I can 'watch and learn' or maybe illustrate to me with the
same Heap::Elem extension?
Thanks for your help!
Cheers,
Ankit
Hello,
Heap::Simple's docs show how to order a heap using <key, value> pairs.
http://search.cpan.org/~thospel/Heap-Simple-0.13/lib/Heap/Simple.pm
Don't know if this is what you want?
Just a note as you say you are learning Perl. I found it difficult to know
where
in the perldoc to find the info I needed. I found it easier to eventually
use them
after reading the best source, 'Programming Perl'. It is well written and
after reading it, I was able to use the perldocs much better.
Chris
--
To unsubscribe, e-mail: beginners-unsubscr...@perl.org
For additional commands, e-mail: beginners-h...@perl.org
http://learn.perl.org/
