.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.
A well-structured, relatively compact implementation of Ukkonen's linear time suffix tree construction algorithm in C# 7+. With bonus detailed explanation on the algorithm.
Add a description, image, and links to the ukkonen-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the ukkonen-algorithm topic, visit your repo's landing page and select "manage topics."