vanilla-priority-queue
javascript implementation of a priority queue
javascript implementation of a priority queue
binary heap with fast increaseKey and decreaseKey operations
Binary heap trees implementation
TypeScript Data Structures is a collection of efficient and type-safe data structures and algorithms implemented in TypeScript.
Basic Data Structures in TypeScript
JavaScript implementations for a MinHeap and MaxHeap.
implementation of priority queues using heaps
A JavaScript implementation of Heap's efficient Permutation Algorithm
A TypeScript library for addressable binary heaps, offering efficient min-heap and max-heap implementations, supporting both object-oriented and functional programming paradigms.