Search results
29 packages found
Sort by: Default
- Default
- Most downloaded this week
- Most downloaded this month
- Most dependents
- Recently published
The smallest and simplest JavaScript priority 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.
The smallest and simplest JavaScript priority queue
Fast heap-based priority queue in JavaScript
binary heap implemented over a resizable array with multiple ways of handling predicates
Blazing fast priority queue
Priority Queue, Min Priority Queue, Max Priority Queue. Javascript & Typescript Data Structure.
- Priority Queue
- priority queue
- priorityqueue
- priority-queue
- priority q
- priorityQ
- min
- max
- efficient
- priority
- heap
- binary heap
- binaryheap
- heap property
- View more
Min Priority Queue. Javascript & Typescript Data Structure.
- Min Priority Queue
- min priority queue
- minpriorityqueue
- min-priority-queue
- Priority Queue
- priority queue
- priorityqueue
- priority-queue
- priority q
- priorityQ
- min
- max
- efficient
- priority
- View more
Max Priority Queue. Javascript & Typescript Data Structure.
- Max Priority Queue
- max priority queue
- max-priority-queue
- maxpriorityqueue
- max value
- extract maximum
- Priority Queue
- priority queue
- priorityqueue
- priority-queue
- priority q
- priorityQ
- min
- max
- View more
An implementation of the binary heap data structure
Data structure and graph processing library written in modern JavaScript
- data structures
- javascript
- graph
- undirected graph
- directed graph
- weighted graph
- breadth first search
- BFS
- depth first search
- DFS
- dijkstra
- shortest path
- prim
- minimum spanning tree
- View more
A small and mighty suite of data structures in JavaScript.
An efficient es6 implementation of priority queue using binary heap data structure
- npm
- es6
- priority queue
- optimization
- efficient
- heap
- binary heap
- max heap
- min heap
- heapsort
- extract min
- extract max
- data structure
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
Collection of TypeScript data structures
A stable heap-based priority queue in JavaScript
Binary heap
Fast heap-based priority queue in TypeScript
A binary heap implementation in JavaScript
Updatable heap-based priority queue in JavaScript