Description
Provides pure priority search queues for Haskell. A priority search queue combines key-based lookup with priority-based ordering, which is useful for algorithms that need both operations.
It is useful for schedulers, graph algorithms, caches, simulations, and search problems. It is a data-structure library and has no standalone queue application.