A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search.
-
Updated
Mar 22, 2023 - Go
A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search.
A prefix tree (trie) implementation in go
adaptive radix tree (a.k.a prefix tree or compact trie)
Efficient generic radix tree (trie) implementation in go
Flash Trie: Beyond 100-Gb/s IP Route Lookup Using Hash-Based Prefix-Compressed Trie
Generic prefix tree for golang
Missing Trie implementation for Go
Trie data structure implementation in Golang 🌳
pretree is a package for storing and querying routing rules with prefix tree .
Radix is an adaptive radix tree for in-memory database indexes.
Yet another thread-safe Golang trie implementation.
Tree structure implementations in golang
Pretty simple implementation of prefix tree for matching byte arrays
Add a description, image, and links to the prefix-tree topic page so that developers can more easily learn about it.
To associate your repository with the prefix-tree topic, visit your repo's landing page and select "manage topics."