trie-data-structure
There are 98 repositories under trie-data-structure topic.
qwertie/ecsharp
Home of LoycCore, the LES language of Loyc trees, the Enhanced C# parser, the LeMP macro preprocessor, and the LLLPG parser generator.
rohansuri/adaptive-radix-tree
A fast and space efficient Radix tree in Java
aboffa/CoCo-trie
COllapsed and COmpressed trie: a data-aware compressed string dictionary
SamirPaulb/autocomplete
Auto Complete / Suggestion feature using Trie data structure
monirz/gotri
Trie data structure implementation in Golang 🌳
monirz/wordgo
A crossed platform desktop (dictionary) application written in Goa nd QT/QML :green_book: :fire:
locchuong/autocomplete
autocomplete function used search engines, spell-checking, text-messengers, etc. Includes a bloom filter that provides memory efficient check of whether an item has been inserted before through the use of hashing algorithms (FNV1AHash, CRCHash, and SBDMHash).
SandroMaglione/itrie
Efficient, immutable and stack safe implementation of a Trie data structure in dart: autocomplete, text search, spell checking, strings and prefixes
Ajitesh27/Dictionary-using-Trie-Datastructure
3rd sem Data Structures project to implement a real world dictionary using Trie data structure.
AleksandrHovhannisyan/Python-Trie-Implementation
Python trie implementation, for educational purposes
Devinterview-io/trie-data-structure-interview-questions
🟣 Trie Data Structure interview questions and answers to help you prepare for your next data structures and algorithms interview in 2024.
OrionJoshi/AutoSuggest_Tool
Auto Suggestion Using Trie
shubham0204/text-predictor-android
Next word prediction and word auto-complete for Android - with the power of Rust 🚀
rakshakannu/Trie-Auto-complete
A simple implementation of a Trie data structure to auto-complete words.
roman-vygon/simpleDATrie
Simple Double Array Trie implementation
courseworks/AUT_AP_2024_Spring_HW3
The third assignment for AUT's Advanced Programming course (Spring 2024), focusing on the implementation and understanding of Bloom Filters and Tries. These structures optimize space and search operations, crucial for network systems and data processing.
idle-PB/Squint3
Squint- Sparse Quad Union Indexed Nibble Trie
JohnPapad/Distributed-File-Management-Tool
A distributed File Management Tool in C++, using processes, forking, named-pipes (FIFOs) and low-level I/O.
SubasriSK/Auto-Complete_Feature
Auto Complete / Suggestion feature using Trie data structure
h-sifat/word-unscrambler-visualizer
A simple app to visualize word unscrambling algorithm with the trie data structure.
himeshmehta/Auto-Suggest-or-Auto-complete-using-CPP-
implement auto_suggest and auto_complete feature using "TRIE" in C++.
parshwa1999/parts-of-speech-recogniser
C program to find parts of speech in a given sentence
sangpham2710/CS163-Project
A multilingual, blazingly fast, offline dictionary for CS163 Final Project
shhsu/Subnet
High Performance C# Subnetting
thenamevishnu/browser
Browser is a compact web browser project aiming for simplicity and efficiency. Explore basic browsing functionalities, straightforward web browsing experience without unnecessary complexities.
thenamevishnu/job-sector-server-side
Job sector is the ultimate destination for freelancers across the board. Discover a diverse array of projects, collaborate with clients, and take your freelance journey to new heights. Whether you're a creative, coder, or consultant, job sector opens doors to success.
thenamevishnu/word-suggestion
Word suggestion is an npm module delivering intelligent word suggestions for enhanced text input in your applications. Elevate user experience with dynamic and context-aware suggestions, making content creation a breeze. Integrate word-suggestion to add a touch of efficiency to your projects.
aashannon/CS223-Homework
Advance Data Structure Studies
BhumikaSuresh/Contact_search
This project implements auto-complete function, like in a Phone book. The search is implemented with Trie data structure for efficiency - this optimises from searching by reading n strings to just reading a single string. Contacts can also be inserted and deleted.
mayankmittal29/FileHub--Portable-User-Interfaced-Network-File-System
NFS for users to manage their system storage files and directories
mmahdin/AUT_AP_2024_Spring
advanced programming course focused on C++ programming (C++23)
mzusin/mz-trie
Typescript implementation of trie/digital tree/radix tree/prefix tree/suffix tree.
satbit007/String-based-Trie-of-Suffix-Tries
Generating auto-correction suggestions using keyboard user-input by traversing the suffix trie based on the user input data so far and offering the most-likely string outcome based on a simplistic counter mechanism to track the user’s most used paths taken based on that scenario (similarly to a fusion tree)
sujal2048/Auto_Complete_Feature
This projects implements the Trie Data Structure which create an autocomplete feature
vemonet/ptrie
🎄 Generic trie data structure (prefix tree) in Rust, with functions to search for common prefixes and postfixes
vipulgoel30/trie-dictionary
A TypeScript Trie data structure for efficient word insertion, lookup, deletion, traversal, and autocomplete features.