Search results for "dist:Array-Heap-ModifiablePriorityQueue array::compare"
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::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