Contains CPP code for prefix searching using Trie (n-ary trees)
-
Updated
Oct 30, 2017 - C++
Contains CPP code for prefix searching using Trie (n-ary trees)
A simple word processor using data structures like tries. This project is a property of Purdue University, and copying any part of the code would be a violation of Purdue's academic honesty code.
Data-structures and algorithms
90+ Solved Data Structure Problems using C++
This project implements an interactive map of the area surrounding UC Berkeley with routing capabilities. It mainly uses a trie (prefix tree) structure.
Basic Implementation of Data-structures in Go
Java program for a custom hash trie data structure to calculate shortest path for airplane itinerary
🔍 A React app with blazing fast sub millisecond autocomplete suggestions using a weighted trie.
Contains the DAA SEE Programs coded in Python
This is a collection of implementation of a variety of algorithms implemented in Go. Clean and simple code to help people get started with data structures and algorithms in golang.
This repository contains solutions to the Data Structures in C++ course of Coding Ninjas.
Inverted index search engine with lemmatized keys and weighted(corpus based) word prediction by prefix
Functionality of designing a search query based autocomplete system - for search engines
Great coding challenges using many programming languages
Based on my knowledge so far, the best data structure is b-tree, red-black-tree is also good but saving it to json file is a problem.
The project contains a miniature offline model of search engine that uses hybrid of various data structures to scan and index information from multiple local files and respond to queries.
Natural Language Processing algorithms implementation. Current implementation features sentence completion and knowledge building
Add a description, image, and links to the tries topic page so that developers can more easily learn about it.
To associate your repository with the tries topic, visit your repo's landing page and select "manage topics."