Search results
95 packages found
Javascript Data Structure. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree(BST), AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max
- data
- structure
- structures
- data structure
- datastructure
- data-structure
- data structures
- datastructures
- data-structures
- in data structures
- in data structure
- binary
- depth
- breadth
- View more
Curated collection of data structures for the JavaScript/TypeScript.
- bag
- bimap
- bit array
- bit set
- bit vector
- bitset
- bk tree
- burkhard-keller tree
- cache
- circular buffer
- counter
- data structures
- default map
- deque
- View more
Trie Data Structure to support cspell.
Trie, Prefix tree. Javascript & Typescript Data Structure.
- Trie
- prefix tree
- prefixtree
- Prefix tree
- prefix-tree
- prefix
- digital tree
- digitaltree
- Digital Tree
- digital-tree
- digital
- radix tree
- radixtree
- Radix Tree
- View more
Efficient data structures for every day programming
- graph
- heap
- linked list
- max heap
- max stack
- min heap
- min stack
- quick stack
- priority queue
- queue
- stack
- trie
- binary-search
Javascript Data Structure. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree(BST), AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max
- data
- structure
- structures
- data structure
- datastructure
- data-structure
- data structures
- datastructures
- data-structures
- in data structures
- in data structure
- binary
- depth
- breadth
- View more
Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.
Trie-based map data structure with prefix search/query support
TS/JS Map-like data structure backed by trie
Strongly typed trie data structure for path and URL-like strings.
Trie
Trie data structure implementation in javascript
Fork of HAMT that adds transient mutation and support for custom key types
This package can be used to implement a Search-As-You-Type funtionality and uses a Trie data structure
This package provides a powerful Radix data storage and retrieval library for TypeScript. It allows you to efficiently store and manage structured data using a Radix tree data structure.
usingbytes-dsa is comprehensive JavaScript library for common data structures and algorithms. This library is designed to be both educational and practical, providing implementations of fundamental data structures and algorithms that can be used in a vari
- data-structures
- algorithms
- javascript
- list
- tree
- SinglylinkedList
- DoublyLinkedList
- OrderedSinglyLinkedList
- OrderedDoublyLinkedList
- CircularSinglyLinkedList
- CircularDoublyLinkedList
- BinarySearchTree
- AVLTree
- RedBlackTree
- View more
Trie implemented dictionary
Collection of Data Structure implementations written in JavaScript
production-ready data structures implementation in javascript & typescript.
- data structures typescript
- es6 data structures
- javascript data structures
- data structures
- data structures javascript
- data structures js
- stack
- es6 stack
- queue
- es6 queue
- priority queue
- priorityqueue
- set
- linked list
- View more