.NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.
-
Updated
Sep 25, 2022 - C#
.NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.
PruningRadixTrie - 1000x faster Radix trie for prefix search & auto-complete
DAWG String Dictionary in C#
Trie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.
Very fast C# implementation of Aho Corasick algorithm based on Double Array Trie.
Designed by Engineers for Engineers. This is your One stop shop for all DSA queries! Here you will find implementation of all sorts of data structures and algorithms.
A lightweight full text indexer for .NET
A trie (prefix tree) data structure implementation in C#.
Wordament solver that handles an arbitrary number of special tiles, finds the many-to-many word-path relationships, and approximates a best path.
Implementation of some known string algorithmn and data structures like: Rope, Trie, Knuth Morris Pratt, Boyer Moore, Levenshtein
C# solutions to common data structures and algorithm problems
An implementation of a trie-like data structure using Azure Table Storage to enable type-ahead style searching
A collection of Data Structures and Algorithms for preparing to coding interviews.
A text search engine made in C#. Supports different operators and comes with an easy-to-use web application.
Simple inverted-index based search engine implementation
C# implementation of a ternary search trie.
C# Concurrent Trie implementation - a port from Roman Levenstein Java based concurrent trie
optimal data structure
Add a description, image, and links to the trie topic page so that developers can more easily learn about it.
To associate your repository with the trie topic, visit your repo's landing page and select "manage topics."