trie

kpol

Trie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.

c-sharp algorithm

View on GitHub

117 Stars

22 Forks

4 Watchers

C# Language

mit License

100 SrcLog Score

Cost to Build

$132.0K

Market Value

$265.6K

How is this calculated?

Growth over time

12 data points · 2021-03-01 → 2026-08-01

Stars Forks Watchers

💬

How do you feel about this project?

Ask AI about trie

Question copied to clipboard

What is the kpol/trie GitHub project? Description: "Trie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.". Written in C#. Explain what it does, its main use cases, key features, and who would benefit from using it.

Question is copied to clipboard — paste it after the AI opens.

How to clone trie

Clone via HTTPS

git clone https://github.com/kpol/trie.git

Clone via SSH

[email protected]:kpol/trie.git

Download ZIP

Download main.zip

Found an issue?

Report bugs or request features on the trie issue tracker:

Open GitHub Issues

Similar to trie

shadowsocks-windows CodeHub CNTK coreclr WaveFunctionCollapse SignalR Nancy efcore Newtonsoft.Json OpenRA aspnetboilerplate MahApps.Metro MaterialDesignInXamlToolkit mal Avalonia CefSharp choco ServiceStack Squirrel.Windows WeiXinMPSDK Hearthstone-Deck-Tracker BenchmarkDotNet duplicati ArchiSteamFarm framework StackExchange.Redis Entitas quartznet MvvmCross UniRx