Networks and Algorithms Performance course work
Android app with efficient prefix search of cities using a Trie data structure, GSON for JSON parsing, and map integration.
Critbit tree for JRuby
Library for auto complete in Python. It comes with set of standard english words for quick start.
Wolfram Language (aka Mathematica) paclet with functions for creation and manipulation of tries (prefix trees) with frequencies.
A very simple yet algorithmically smart notepad. It's a PoC for real world application of the algorithms
T9 Dictionary: Python program implementing word search with T9 dictionary functionality, developed at Jagiellonian University. Features a graphical interface and utilizes prefix tree data structure.
Provides different Java implementations of tries (prefix trees)
Trie data structure implementation in Golang 🌳
High Performance C# Subnetting
Perl extension for a PrefixTree
Telephone Directory with prefix based search functionality (Using Trie data structure)
Using tire-tree to search keywords matching efficiently.
Typescript implementation of trie/digital tree/radix tree/prefix tree/suffix tree.
Dynamic Score-Decomposed Tries which more efficiently solve the prefix autocomplete problem
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."