Heap::Simple - Fast and easy to use classic heaps

++

++

A heap is a partially sorted structure where it's always easy to extract the smallest element. If the collection of elements is changing dynamically, a heap has less overhead than keeping the collection fully sorted. The order in which equal elements...

THOSPEL/Heap-Simple-0.13 - 27 Jan 2008 15:14:03 UTC - Search in distribution