prefix-tree

A high performance, zero-copy URL router.

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

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

A prefix tree implementation in go

This script generates and analyzes prefix tree adders.

Efficiently keep track of changes to genomes

A prefix tree (trie) implementation in go

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

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

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

Efficient generic compact radix tree (trie) implementation in go

An efficient data structure for fast string similarity searches

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

Performance shootout of various trie implementations

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

Genetic programming for math equations with prefix expression trees.

Fast fuzzy string search

Generic prefix tree for golang

Missing Trie implementation for Go

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