A prefix tree (trie) implementation in go
-
Updated
Jul 13, 2024 - Go
A prefix tree (trie) implementation in go
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
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++
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
cpp-match is a powerful C++ library for pattern matching and functional-style programming, allowing developers to write concise and expressive code for handling complex data structures efficiently. The library provides a clean and intuitive syntax for matching patterns, making it easier to work with data in a functional programming paradigm.
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."