Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
MIT License
A collection of generic data structures written in Go.
graph and tree algorithms in Go
adaptive radix tree (a.k.a prefix tree or compact trie)
An Adaptive Radix Tree (ART) implementation in Go
Solutions and implementations of Leetcode problems in Go.
Data Structures and Algorithms implementation in Go
Fast, zero heap allocation Go Trie for runes or paths
Simple Implementation of Modified Merkle Patricia Tries
A collection of useful, performant, and threadsafe Go datastructures.
[WIP] Implementation of HAT-trie in Go
Surprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).