heap-map
A binary heap with a mapping of elements to indexes for more efficient lookups and modifications.
A binary heap with a mapping of elements to indexes for more efficient lookups and modifications.
Algorithms and data structures for your JavaScript and TypeScript projects 🧑💻
Data Structures of Javascript & TypeScript. AVLTree, Binary Search Tree, Binary Tree, Tree Multiset, Graph, Heap, Priority Queue, Linked List.
Max Heap
Max Priority Queue
An implementation of PriorityQueue data structure.
Blazing fast priority queue
Strictly TypeScripted Collections inspired by OpenJDK
Standard data structure
ES6 JS lightweight data structures (Priority Queue, Binary Search Tree (BST), Graph, Bloom Filters, Trie, Queue, Stack, Linked-List)
Efficient priority queue written in Rust and compiled to WebAssembly
"SDK for commonly used data structure and algorithms"