Prefix Tree Python Packages

expanse-trie

256-ary radix trie and Judy arrays in Rust — drop-in libjudy C ABI, MIT/Apache-2.0

prefixtrie

This is a high-performance implementation of a Prefix Trie to perform efficient fuzzy string matches.

edge-genome

Efficiently keep track of changes to genomes

triesus

Find the Smallest Unique Subset (SUS), fast

larzstruct

Data structures the stdlib leaves out: Bloom filter, Trie, union-find (disjoint set), ring buffer. Pure Python, zero dependencies.

nodetrie

Python bindings for NodeTrie, a prefix tree data structure library

pyauto-compl

Library for auto complete in Python. It comes with set of standard english words for quick start.