trie
Missing Trie implementation for Go (by krasun)
go-succinct-data-structure-trie
Succinct Data Structure of Trie, written in Go (by siongui)
| trie | go-succinct-data-structure-trie | |
|---|---|---|
| 1 | 1 | |
| 11 | 42 | |
| - | - | |
| 0.0 | 0.0 | |
| over 2 years ago | over 2 years ago | |
| Go | Go | |
| MIT License | The Unlicense |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
trie
Posts with mentions or reviews of trie.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-03-07.
-
Go and Trie!
You can also use mine, but it is not optimized and created for learning purposes
go-succinct-data-structure-trie
Posts with mentions or reviews of go-succinct-data-structure-trie.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-03-07.
What are some alternatives?
When comparing trie and go-succinct-data-structure-trie you can also consider the following projects:
ptrie - A prefix tree implementation in go
router - Router implementation for fasthttp
trie - Generic prefix tree for golang
trie - A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search.
art - Adaptive Radix Tree done right
chtrie - Coordinate Hash Trie: A Trie Variant Balancing between Time, Space, and Simplicity