Awesome Open Source

Programming Languages

Search results for trie prefix tree

18 search results found

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

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

Csharp Trie ⭐ 33

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

Prefixtree ⭐ 20

A prefix tree (trie) implementation in go

A prefix tree implementation in go

Radixtree ⭐ 18

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

Trie Perf ⭐ 17

Performance shootout of various trie implementations

Dynamic Score-Decomposed Tries which solve the prefix autocomplete problem

Flashtrie.go ⭐ 14

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

Efficient generic radix tree (trie) implementation in go

An efficient data structure for fast string similarity searches

Generic prefix tree for golang

Ffsearch ⭐ 10

Fast fuzzy string search

Trie data structure implementation in Golang 🌳

Weighted_trie ⭐ 8

🦀 Rust crate that allows creating weighted prefix trees that can be used in autocomplete

Missing Trie implementation for Go

Dict Trie ⭐ 6

Trie implementation for approximate string matching.

Critbit tree for JRuby

Related Searches

Java Trie (239)

Data Structure Trie (221)

C Plus Plus Trie (208)

Python Trie (193)

Javascript Trie (176)

Golang Trie (174)

Algorithms Trie (152)

Search Trie (133)

Leetcode Trie (76)

1-18 of 18 search results

Privacy | About | Terms | Follow Us On Twitter

Copyright 2018-2024 Awesome Open Source. All rights reserved.