Priority-queue Packages

Max Priority Queue

AlgoVerse is a JavaScript library for efficient algorithms, data structures, and interactive visualizations. It helps developers implement and visualize structures like heaps, graphs, and trees in real time.

axios-retryer is an advanced Axios request manager offering intelligent retry logic with token refresh, concurrency control, priority queuing, and a flexible plugin architecture, all built with TypeScript for robust HTTP client integrations.

ds-kit is an NPM package provide ready to use famous data structures to JavaScript. It draws inspiration from the structured beauty of C++ STL.

A modular and efficient implementation of a Priority Queue with enqueue-optimized and dequeue-optimized strategies.

A flexible async task scheduler with multi-level priorities, concurrency control, and priority decay for Javascript and Typescript.

Standard data structure

Data structures and algorithms written in JavaScript with TypeScript types

Implementation of the bucket queue data structure in TypeScript

Min Heap

Min Priority Queue

A JavaScript package that implements the Max-Heap data structure, providing essential methods for heap operations.

A JavaScript package implementing the Min-Heap data structure for efficient priority queue operations.

Priority Queue data structure implementation in JavaScript for efficient data handling and retrieval.

A priority queue written in TypeScript.

⚡ A fast and lightweight priority queue implementation for JavaScript.

implementation of priority queues using heaps

Data Structures of Javascript & TypeScript. Binary Tree, BST, Graph, Heap, Priority Queue, Linked List, Queue, Deque, Stack, AVL Tree, Tree Multiset, Trie, Directed Graph, Undirected Graph, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Qu

A simple priority-based pub-sub system for beginners.

A asynchronous priority queue implementation