A generic patricia trie (also called radix tree) implemented in Go (Golang)
-
Updated
Aug 8, 2022 - Go
A generic patricia trie (also called radix tree) implemented in Go (Golang)
PruningRadixTrie - 1000x faster Radix trie for prefix search & auto-complete
Garbage collector-sensitive patricia tree for IP/CIDR tagging
A memory-efficient patricia tree implementation written in Rust
Instant auto suggestion and completion
A library of binary tree data structures (bstree, dstree, trie, crit-bit, PATRICIA) implemented in C
An example showing how to read Merkle Patricia Trie for Ethereum block or contract
Efficient generic radix tree (trie) implementation in go
Golang radix tree implementation
A java implementation of patricia-merkle-trie data structure
Store CIDR IP addresses (both v4 and v6) in a trie for easy lookup.
A model-based QuickCheck test of ptrees (Patricia trees)
Multi Key Radix PATRICIA Fast Search - OO C++ - a C++ header file only class
Patricia trie on C++
Practical Works Algorithm and Data Structures II
Various merkle trees
Advanced Algorithms and Data Structures FER labs
Árvores PATRICIA em Python.
Add a description, image, and links to the patricia-tree topic page so that developers can more easily learn about it.
To associate your repository with the patricia-tree topic, visit your repo's landing page and select "manage topics."