GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more

A complete, fully tested and documented data structure library written in pure JavaScript.

leetcode.com , algoexpert.io solutions in python and swift

The fastest JavaScript priority queue out there. Zero dependencies.

The smallest and simplest priority queue in JavaScript.

Common data structures and algorithms implemented in JavaScript

A very fast and simple 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.

Computer Science Data Structures and Algorithms in JavaScript ( Node.JS, ES ) in simple, clean, reusable code

GoDS-Generic (Go Generic Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more

A collection of Data Structures implemented in Swift.

A load balanced threadpool.

Generic data structure using parameterized types in Golang.

Priority Queue in Typescript & Javascript

Data Structures in C++

A generic keyed priority queue implementation for Golang.

Efficient binary heap and Fibonacci heap implementation

Implementing the Dijkstra algorithm with a d-ary heap

A generic binary max heap for implementing a dynamically prioritizable priority queue.

A simplistic and optimised priority queue for C#.