The fastest JavaScript priority queue out there. Zero dependencies.
- Updated
Mar 14, 2023 - TypeScript
The fastest JavaScript priority queue out there. Zero dependencies.
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.
Priority Queue in Typescript & Javascript
Collection data structures that are not standard built-in objects in JavaScript. This includes a vector (double-ended queue), binary heap (priority queue), binary search tree, and a red black tree.
A collection of heap implementations prioritizing speed performance, released to the public domain🚀
Typescript implementation of minimum and maximum heap (priority queue).
Data Structures in TypeScript
A highly efficient, flexible queue system for managing the execution of asynchronous tasks with customizable priorities, retries, and timeouts. Designed for use in JavaScript/TypeScript applications, this library helps you manage concurrency, schedule tasks, and control execution flow with ease.
Data Structure in TypeScript
A library consisting of standard data structures implemented using TypeScript.
A data structure and algorithms library written in TypeScript.
A versatile TypeScript library for addressable binary heaps, delivering optimized and scalable min-heap & max-heap implementations, seamlessly supporting both object-oriented and functional paradigms.
Priority queue implemented with indirect binary heap
A flexible binary heap. Can be used as a priority queue.
Add a description, image, and links to the binary-heap topic page so that developers can more easily learn about it.
To associate your repository with the binary-heap topic, visit your repo's landing page and select "manage topics."