Search results
104 packages found
Data structure and graph processing library written in modern JavaScript
- data structures
- javascript
- graph
- undirected graph
- directed graph
- weighted graph
- breadth first search
- BFS
- depth first search
- DFS
- dijkstra
- shortest path
- prim
- minimum spanning tree
- View more
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
Observable Path Trie Store
- observable
- reactive
- rxjs
- trie
- tree
- store
- state
- observable tree
- observable state
- observable store
- reactive tree
- reactive state
- reactive store
Implementation of verkle trees as used in Ethereum.
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.
Search Really Really Fast
This is an implementation of the modified merkle patricia tree as speficed in the Vapory's yellow paper.
A library for quick insert and retrieval of JavaScript objects, keyed by prefix strings.
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
An implementation of the modified merkle patricia tree used in Ethereum, optimized for in-memory usage
Like Lego For Databases
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
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
NoSQL Everywhere
Trie tree implementation with keywords density calcuation functionality
Like Lego For Databases