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

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.

A very fast and simple JavaScript priority queue

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

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.

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

Efficient binary heap and Fibonacci heap implementation

Direct ports of the standard library's BTreeMap, BTreeSet and BinaryHeap collections, but that sort according to a specified total order rather than the `Ord` trait

Implementing the Dijkstra algorithm with a d-ary heap

A simplistic and optimised priority queue for C#.

Performance Comparison of Prim's Algorithm using Different Priority Queues

No description provided.

This is a sliding puzzle game with AI solution finder. The solution employs a minimum priority queue (binary heap) coupled with an A* algorithm.

Learning tree data structures and related algorithms.

Unity project showcasing A* pathfinding visualization.

Collection data structures that are not standard built-in objects in JavaScript. This includes a vector (double-ended queue), binary heap (priority queue), binary search tree, and a red black tree.

Priority queue in 26 lines (863 bytes): gusset-dampeningly small and fast 💅

This Repository contains the core concepts and implementation of Data Structures & Algorithms which include arrays, linked list, queues , stacks ,binary trees, BST, AVL Trees, sorting techniques and general operations

Priority Queue structure implementations in C# using binary heaps and fibonacci heaps

Binary heap module in python (Min Heap, Max Heap)