A high performance, zero-copy URL router.

• UpdatedOct 26, 2025
• Rust

Trie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.

• UpdatedJul 17, 2025
• C#

A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search.

• UpdatedMar 22, 2023
• Go

A prefix tree implementation in go

• UpdatedApr 5, 2024
• Go

This script generates and analyzes prefix tree adders.

• UpdatedApr 9, 2021
• Python

A prefix tree (trie) implementation in go

• UpdatedJul 13, 2024
• Go

Efficiently keep track of changes to genomes

• UpdatedJul 22, 2024
• Python

A trie (prefix tree) data structure implementation in C#.

• UpdatedJul 26, 2025
• C#

adaptive radix tree (a.k.a prefix tree or compact trie)

• UpdatedMar 21, 2025
• Go

Dynamic Score-Decomposed Tries which more efficiently solve the prefix autocomplete problem

• UpdatedMar 30, 2025
• Zig

Efficient generic compact radix tree (trie) implementation in go

• UpdatedJun 2, 2023
• Go

An efficient data structure for fast string similarity searches

• UpdatedFeb 8, 2021
• Python

This repository will contain codes of " Compiler Design (CSE3142) ".

• UpdatedNov 20, 2022
• C++

Performance shootout of various trie implementations

• UpdatedMay 30, 2019
• Haskell

Flash Trie: Beyond 100-Gb/s IP Route Lookup Using Hash-Based Prefix-Compressed Trie

• UpdatedSep 8, 2025
• Go

Genetic programming for math equations with prefix expression trees.

• UpdatedSep 2, 2018
• JavaScript

Fast fuzzy string search

• UpdatedFeb 21, 2022
• C++

Generic prefix tree for golang

• UpdatedApr 25, 2025
• Go

Missing Trie implementation for Go

• UpdatedJan 6, 2022
• Go

Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.

• UpdatedJan 26, 2025
• TypeScript