min-priority-queue-typed
Min Priority Queue
Min Priority Queue
Heap data structure for JavaScript / TypeScript.
Priority Queue
Simple, flexible, and performant implementation of the heap data structure.
A binary heap with a mapping of elements to indexes for more efficient lookups and modifications.
A small and mighty suite of data structures in JavaScript.
Max Priority Queue
Blazing fast priority queue
A TypeScript library for addressable binary heaps, offering efficient min-heap and max-heap implementations, supporting both object-oriented and functional programming paradigms.