Search results for "module:Heap::Simple"
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
Heap::Simple::XS - An XS implementation of the Heap::Simple interface
This module provides an XS implementation of the interface described in Heap::Simple. Look there for a description....
THOSPEL/Heap-Simple-XS-0.10 - 13 Jan 2008 16:36:38 UTC
Heap::Simple::Perl - A pure perl implementation of the Heap::Simple interface
This module provides a pure perl implementation of the interface described in Heap::Simple. Look there for a description....
THOSPEL/Heap-Simple-Perl-0.14 - 27 Jan 2008 23:49:53 UTC
Array::Heap::ModifiablePriorityQueue - Modifiable priority queue
This module implements a priority queue, which is a data structure that can efficiently locate the item with the lowest weight at any time. This is useful for writing cost-minimizing and shortest-path algorithms. Why another priority queue module? Fi...
BOBMATH/Array-Heap-ModifiablePriorityQueue-1.10 - 13 Jul 2015 00:27:55 UTC