A very simple yet algorithmically smart notepad. It's a PoC for real world application of the algorithms
-
Updated
Jun 23, 2024 - Java
A very simple yet algorithmically smart notepad. It's a PoC for real world application of the algorithms
ES6 Data Structures
Raku package with functions for creation and manipulation of tries (prefix trees) with frequencies
A prefix tree (trie) implementation in go
Flash Trie: Beyond 100-Gb/s IP Route Lookup Using Hash-Based Prefix-Compressed Trie
A trie (prefix tree) data structure implementation in C#.
Trie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.
A high performance, zero-copy URL router.
My code for some important data structure, algorithm and number theory
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.
Generic prefix tree for golang
🎄 Generic trie data structure (prefix tree) in Rust, with functions to search for common prefixes and postfixes
adaptive radix tree (a.k.a prefix tree or compact trie)
Trie implementation for approximate string matching.
Find the Smallest Unique Subset (SUS), fast
Generic implementation of a prefix tree
Typescript implementation of trie/digital tree/radix tree/prefix tree/suffix tree.
Dynamic Score-Decomposed Tries which more efficiently solve the prefix autocomplete problem
Intellisense implemented in python using multiple machine learning and baseline prefix trees based strategy
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."