idati
A set of common used data structure.
A set of common used data structure.
A TS/JS library for doing immutable updates and querying on nested data structures in a way that is composable and powerful.
Implementation of a persistent hash array mapped trie in TypeScript
Heap
Lightweight, optimized, and efficient implementations for FIFO (queue) data structure
Max Heap
Max Priority Queue
data-structure
Reactive graphs and hashmaps.
This library in Typescript has definitions and operators for reactive data streams. You can use this library to define streams, writable and readable and combine them or bind them to each other.
Contains a TypeScript implementation for serializable data and basic algorithms.
Essential data structures and algorithms for graph
Tiny queue data structure
Computer Science: Binary Search Tree demonstration using JavaScript.
Computer Science: Linked Lists demonstration.
Data structures implemented by typescript.
A B-tree implementation in TypeScript
A lightweight and efficient LRU (Least Recently Used) cache implementation for JavaScript and TypeScript.
Abstract Queue to be used for more concrete Queues.