Search results
17 packages found
Data Structures of Javascript & TypeScript. 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
- 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, 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
A lightweight trie implementation.
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.
Compute prefix sums of arrays in O(log n)
A prefix tree for compressing long strings
N-dimensional Binary Indexed Tree
an implementation of the radix tree data structure, designed for extensibility
- compressed prefix tree
- prefix tree
- prefix
- radix tree
- radix
- tree
- traversal
- autocomplete
- depth first
- preorder
- postorder
- breadth first
A flexible implementation of a trie (prefix tree) to let you efficiently find partial and complete matches of stored values. A trie is a tree-like data structure, also referred to as a prefix tree, that enables optimized searching for specific keys from a
Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.
Patricia (or Radix) tree with autocomplete support
A compact trie for mapping keys to values
A serializable compact prefix trie
- compact-prefix-tree
- compact-radix-tree
- compact-trie
- data-structure
- patricia-tree
- prefix-tree
- prefix
- radix-tree
- trie
Partial port of aphyr/clj-antlr bindings for ANTLR 4 parser library, returning a tree or sexpr-formatted tree
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
TypeScript library providing a trie (prefix tree) datastructure.