Description
Implementation of priority search queues as finger trees.
Description
An implementation of priority search queues: a datastructure holding key/priority bindings having fast operations both for extracting the element with minimum priority and for modifying and looking up elements by key.