trie-tree
Here are 38 public repositories matching this topic...
Data Structures and Algorithms
-
Updated
Dec 28, 2023 - C++
Using a trie we predict the next closest words to the input.
-
Updated
Oct 30, 2020 - C++
During the Data Structure II - DCC012B course, we developed a program that performs the reading, processing and manipulation of a collection of books: through such implementations it was possible to capture the 50 words that are most repeated in each book, as well as the 50 most repeated words among all the books in the collection. In short, eve…
-
Updated
Aug 29, 2022 - C++
Лаба 4.0, ТРАЙ ДЕРЕВО, ДОБАВЛЕНИЕ, УДАЛЕНИЕ, ПРОВЕРКА НА НАЛИЧИЕ, ПЕРЕСЕЧЕНИЯ МНОЖЕСТВ, Корчагин Д., зачет, ЯМП, 2 сем, 2 к, ПМИ
-
Updated
Jun 29, 2022 - C++
An implementation of the wordBreak problem to split into all possible combinations of words that the original sentence could have been made up of. Takes the input from a file and outputs it to shell.
-
Updated
Dec 22, 2018 - C++
Prefix Trie data structure with Pattern Matching, in C++
-
Updated
Aug 23, 2017 - C++
Graph-Theory, Number-Theory, Classical Dynamic Programming, Searching-Sorting Algorithms and some Advance-Data-Structures are implemented using C++
-
Updated
Oct 22, 2019 - C++
Лаба 4.0, ТРАЙ ДЕРЕВО, ДОБАВЛЕНИЕ, ПОИСК, УДАЛЕНИЕ БУКВЫ, ПЕЧАТЬ НЕКОТОРЫХ СЛОВ, Корчагин Д., ЯМП, зачет, 2 сем, 2 к, ПМИ
-
Updated
Jun 29, 2022 - C++
Лаба 4.12, ТРАЙ ДЕРЕВО, УДАЛЕНИЕ СЛОВ, ДОБАВЛЕНИЕ, ПОИСК, УДАЛЕНИЕ БУКВЫ, зачет, Корчагин Д., ЯМП, 2 сем, 2 к, ПМИ
-
Updated
Jun 20, 2022 - C++
Repositório com trabalhos da disciplina Estrutura de Dados II.
-
Updated
Dec 21, 2022 - C++
A command line program capable of manipulating 33+ millions of data from a csv using a Trie tree
-
Updated
Jul 7, 2024 - C++
-
Updated
Oct 29, 2023 - C++
Лаба 4.13, ТРАЙ ДЕРЕВО, ДОБАВЛЕНИЕ, ПОИСК, УДАЛЕНИЕ БУКВЫ, КОЛ. СЛОВ ОКАНЧ. НА СОГЛ. БУКВУ, Корчагин Д., ЯМП, зачет, 2 сем, 2 к, ПМИ
-
Updated
Jun 30, 2022 - C++
Лаба 4.6, ТРАЙ ДЕРЕВО, ДОБАВЛЕНИЕ, ПОИСК, УДАЛЕНИЕ БУКВЫ, УДАЛЕНИЕ СИММЕТРИЧНЫХ СЛОВ, Корчагин Д., ЯМП, зачет, 2 сем, 2 к, ПМИ
-
Updated
Jun 30, 2022 - C++
Implementation of a trie tree in C++, essential for OS structures like file systems and process trees. This assignment reinforces C++ skills, focusing on trie trees for efficient word storage and retrieval.
-
Updated
Dec 11, 2023 - C++
Базовый пример, ТРАЙ ДЕРЕВО, УДАЛЕНИЕ СЛОВ, ДОБАВЛЕНИЕ СЛОВ, зачет, Корчагин Д., ЯМП, 2 сем, 2 к, ПМИ
-
Updated
Sep 8, 2022 - C++
Improve this page
Add a description, image, and links to the trie-tree topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the trie-tree topic, visit your repo's landing page and select "manage topics."