gmamaladze/trienet

.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.

C#Smalltalksearchalgorithmsdotnettriedata-structuresukkonen-algorithmsuffix-tries
This is stars and forks stats for /gmamaladze/trienet repository. As of 29 Apr, 2024 this repository has 407 stars and 67 forks.

usage nuget install TrieNet using Gma.DataStructures.StringSearch; ... var trie = new UkkonenTrie<int>(3); //var trie = new SuffixTrie<int>(3); trie.Add("hello", 1); trie.Add("world", 2); trie.Add("hell", 3); var result = trie.Retrieve("hel"); updates Added UkkonenTrie<T> which is a trie implementation using Ukkonen's algorithm. Finally I managed to port (largely rewritten) a java implementation of Generalized Suffix Tree using Ukkonen's algorithm by Alessandro Bahgat (THANKS!). I...
Read on GithubGithub Stats Page
repotechsstarsweeklyforksweekly
e-maxx-eng/e-maxx-engC++HTMLC5.5k01.3k0
festivize/PrimoToonC#GLSLHLSL4420620
scipy/scipyPythonFortranC11.8k04.9k0
markwright2002/Game_jam_G3ShaderLabC#HLSL0000
rustd/LTAFClassic ASPC#0000
Suprcode/mir-eternalC#15001150
TeamStepping/Stepping.NETC#1130120
HZFE/awesome-interviewHTMLJavaScript2.2k01680
esteininger/vector-searchJupyter NotebookPython2060120
phi-lira/UniversalShaderExamplesShaderLabHLSLC#64801170