tinyqueue
The smallest and simplest JavaScript priority queue
The smallest and simplest JavaScript priority queue
The smallest and simplest JavaScript priority queue
Fast heap-based priority queue in JavaScript
Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.
Blazing fast priority queue
Data structure and graph processing library written in modern JavaScript
An implementation of the binary heap data structure
A stable heap-based priority queue in JavaScript
binary heap implemented over a resizable array with multiple ways of handling predicates
A flexible [binary-heap](https://en.wikipedia.org/wiki/Binary_heap). This data-structure is optimized for the retrieval of either the maximum or the minimum
Binary Heap implementation in JavaScript
a javascript binary heap implementation
An efficient es6 implementation of priority queue using binary heap data structure
Updatable heap-based priority queue in JavaScript
Fast heap-based priority queue in TypeScript
simple implementation of binary heap in js for fun
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. Javascript & Typescript Data Structure.