An implementation of 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.

JavaScript implementation of PriorityQueue (using Min Heap or Max Heap)

es6-priorityqueue

PriorityQueue with superpowers! 💪

Standard JavaScript/TypeScript Library: DoublyLinkedList, Stack, Queue, Heap, MaxHeap, MinHeap, PriorityQueue

javascript Stack Queue PriorityQueue LinkedList

The PriorityQueue from the RxJS library as a standalone module

A JavaScript priorityQueue

JS PriorityQueue

ES6/ES2015 collections library including Stack, Queue, and PriorityQueue

a simple priority queue data structure

A simple and lightweight priority queue

priorityQueue in javascript

An implementation of PriorityQueue data structure.

A performance-oriented PriorityQueue implementation for javascript

Zero-dependency binary heap and priority queue — TypeScript-first npm equivalent of Python heapq, Java PriorityQueue, and Go container/heap.

High-performance data structures (Deque, PriorityQueue) for DSA practice with optimal time complexity

Priority queue data structures

STL-style data structures and algorithms for TypeScript: Vector, Stack, Queue, Deque (double-ended queue), List, PriorityQueue, Map, Set, sort, binarySearch, graph utilities. Use like C++ STL.