Search results for "module:Heap::Priority"
Array::Heap::PriorityQueue::String - String-weighted 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. Weights are strings, which are sorted in lexicographic order. This module is a wrapper around the *_heap_lex m...
BOBMATH/Array-Heap-ModifiablePriorityQueue-1.10 - 13 Jul 2015 00:27:55 UTC
Array::Heap::PriorityQueue::Compare - Priority queue with custom comparison
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. When creating a new queue, you supply...
BOBMATH/Array-Heap-ModifiablePriorityQueue-1.10 - 13 Jul 2015 00:27:55 UTC
Array::Heap::PriorityQueue::Numeric - Numeric 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. Weights are numeric values. This modu...
BOBMATH/Array-Heap-ModifiablePriorityQueue-1.10 - 13 Jul 2015 00:27:55 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
Heap::MinMax - Min-Max Heap for Priority Queues etc.
An implementation of a Min-Max Heap as described in "Min-Max Heaps and Generalized Priority Queues", Atkinson, Sack, Santoro, Strothotte, 1986. Min-Max heaps allow objects to be stored in a 'dual' partially-sorted manner, such that finding both the m...
MBEEBE/Heap-MinMax-1.04 - 18 Mar 2013 14:25:39 UTC
Array::Heap - treat perl arrays as binary heaps/priority queues
There are a multitude of heap and heap-like modules on CPAN, you might want to search for /Heap/ and /Priority/ to find many. They implement more or less fancy datastructures that might well be what you are looking for. This module takes a different ...
MLEHMANN/Array-Heap-3.22 - 07 Dec 2016 12:07:05 UTC
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
Graphics::VTK::Common - A Perl interface to VTKCommon library
Graphics::VTK::Common is an interface to the Common libaray of the C++ visualization toolkit VTK.....
CERNEY/Graphics-VTK-4.0.001 - 01 Feb 2003 15:47:39 UTC