From 8c42ba3f2579108f1ac63c36270b06bc22b47c8e Mon Sep 17 00:00:00 2001 From: Kirill Polishchuk Date: Sat, 30 Mar 2024 13:45:49 +1300 Subject: [PATCH] Update KTrie.csproj --- src/KTrie/KTrie.csproj | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/KTrie/KTrie.csproj b/src/KTrie/KTrie.csproj index 3902498..c56d0f4 100644 --- a/src/KTrie/KTrie.csproj +++ b/src/KTrie/KTrie.csproj @@ -4,7 +4,7 @@ Kirill Polishchuk Trie (a.k.a. prefix tree) is an ordered tree data structure that is used to store an associative array where the keys are usually strings. All the descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string. Kirill Polishchuk - 2.3.0 + 2.4.0 https://github.com/kpol/trie https://github.com/kpol/trie trie, prefix-tree, data-structure