@tyriar/binomial-heap
An implementation of the binomial heap data structure
An implementation of the binomial heap data structure
A library of data structures and algorithms
javascript implementation of a priority queue
A stable heap-based priority queue in JavaScript
Common utility functions implemented in TypeScript.
Typescript Data Structures
Priority Queue implemented using Heap
Data structures & basic algorithms library
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
a javascript binary heap implementation
Jymfony Data Structures
An efficient es6 implementation of priority queue using binary heap data structure
Data structures and algorithms written in JavaScript
Priority Queue implementation in JavaScript
A promisified bucket priority queue written in Typescript with no external dependencies.
Updatable heap-based priority queue in JavaScript
Fast heap-based priority queue in TypeScript
Simple pure-javascript heap
Useful data structures with no dependencies
A simple blocking (asynchronous) priority queue (sorted, not FIFO).