A prefix tree (trie) implementation in go
-
Updated
Jul 13, 2024 - Go
A prefix tree (trie) implementation in go
Knowledge graph of the English language between 1800 and 2019 using open source data, Python 3, and ffmpeg.
A serializable compact prefix tree (also known as Radix tree or Patricia tree or space-optimized trie) implementation in JavaScript.
Raku package with functions for creation and manipulation of tries (prefix trees) with frequencies
Bartez is a crossword generator written in Python using networkx
Realization of the prefix tree
A TypeScript library offering efficient standard (prefix) and compressed (radix) tries for optimized string storage and operations, featuring trie-map variants for key-value storage.
Prefix Trie data structure with Pattern Matching, in Rust
🌌 Visualize the evolution of the English language with a dynamic prefix galaxy, powered by Wiktionary and Google Books datasets.
This project implements a 26-way Trie data structure to manipulate and manage strings efficiently.Then inserts all words to the trie from the given txt file.
data structure libraries for Java
Prefix Trie data structure with Pattern Matching, in C++
Correctness-fixed Rust/PyO3 flat-array DFA prefix cache — rewrite of BCR-memory v1 with regression tests for four bugs and an SGLang/vLLM head-to-head harness.
Add a description, image, and links to the prefix-trie topic page so that developers can more easily learn about it.
To associate your repository with the prefix-trie topic, visit your repo's landing page and select "manage topics."