Description
A Haskell library implementing asymptotically optimal Brodal and Okasaki heaps. Heaps are priority-queue data structures used to retrieve the smallest or highest-priority item efficiently.
Developers use them in graph algorithms, schedulers, search, simulations, and priority-based processing. The best heap choice depends on workload, update frequency, and practical performance beyond asymptotic bounds.