GoDS (Go Data Structures). Containers (Sets, Lists, Stacks, Maps, Trees), Sets (HashSet, TreeSet, LinkedHashSet), Lists (ArrayList, SinglyLinkedList, DoublyLinkedList), Stacks (LinkedListStack, ArrayStack), Maps (HashMap, TreeMap, HashBidiMap, TreeBidiMap, LinkedHashMap), Trees (RedBlackTree, AVLTree, BTree, BinaryHeap), Comparators, Iterators, Enumerables, Sort, JSON

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

A collection of classical data structures and algorithms implemented in Typescript with video lectures

The fastest JavaScript priority queue out there. Zero dependencies.

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

The smallest and simplest priority queue in JavaScript.

Common data structures and algorithms implemented in JavaScript

A very fast and simple JavaScript priority queue

A collection of Data Structures implemented in Swift.

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.

Data structures lectures for computer science students.

Priority Queue in Typescript & Javascript

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

Efficient binary heap and Fibonacci heap implementation

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

Some algorithms and data structures that I made in JS.

🍂 Heap data structures for JavaScript

Implementation of MST Algorithms - 1. Prim's Algorithm (with 3 versions - PriorityQueue<Edge>, PriorityQueue<Vertex>, and IndexedBinaryHeap<Vertices>) and 2. Kruskal's Algorithm on Connected Graphs.

Well known Algorithms, my own Algorithms and Data Structures implemented from scratch

Tree implementations for PHP

Unity project showcasing A* pathfinding visualization.

The pairing heap is an implementation of the priority queue, the heap is represented in binary form.

A simplistic and optimised priority queue for C#.

mercator scheme/rate-limiting/scheduling part of whirlpool project; handles crawler priority and politeness

Implementation of Prim's Algorithm using Heap data structure (coded in arrays from scratch) that can compute the overall spanning weight.

Built with the intention of manipulating a matrix, random generation, integration of A* search.

Implementation of basic data structures for comparison of how fast they perform.

This repository contains all the data structures and their application in Java.