A simple and lightweight priority queue
a simple priority queue data structure
Priority queue data structures
TypeScript definitions for priorityqueuejs
An implementation of Priority Queue
Priority queue data structure where you are able to set your own compare function.
priority queue
Typescript implementation of queues, such as priority queue and circular queue.
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.
TypeScript definitions for js-priority-queue
Production-ready TypeScript data structures: Heap, Deque, Trie, Graph, Red-Black Tree, TreeMap, TreeSet, and more. Zero dependencies, type-safe, with getRank/getByRank/rangeByRank support.
production-ready data structures implementation in javascript & typescript.
Standard TypeScript Library
工具：常用数据类型、算法
A lightweight collection for working with regular and priority queues.
Simple priority Queue implementation for Node.js
⚡ A fast and lightweight priority queue implementation for JavaScript.
JavaScript implementation of PriorityQueue (using Min Heap or Max Heap)
javascript实现各种数据结构：堆、优先队列、字典树、LFU缓存……
TypeScript definitions for quantize
Various heap implementations for arbitrary values and with customizable ordering
Exports useful data structures for TypeScript.
Javascript / Typescript priority queue ( max / min heap )
A framework for node