data-structures
chtrie
| data-structures | chtrie | |
|---|---|---|
| 1 | 5 | |
| 2,797 | 18 | |
| - | - | |
| 0.0 | 4.9 | |
| over 1 year ago | about 1 year ago | |
| Java | C | |
| MIT License | BSD 3-clause "New" or "Revised" License |
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.
data-structures
-
Simple Kruskal implementation for java?
The Union-Find (DSU) algorithm is actually very simple, here is an example implementation in around 100 lines including comments, and you don't need all of it.
chtrie
-
performance of a trie implementation
For comparison, I am using https://github.com/dongyx/chtrie a "coordinated hash trie" implementation by Yuxuan Dong, also described by this https://arxiv.org/abs/2302.03690 paper on arxiv.org. I picked it because it seemed most comparable and lightweight, as well as having a fairly small code size.
- Show HN: Trie implementation balancing between time, space and simplicity
- Coordinate Hash Trie: A Trie Variant Balancing between Time, Space, and Simplicity
- Coordinate Hash Trie: Balancing Between Time, Space, and Simplicity
- The Implementation of the Coordinate Hash Trie
What are some alternatives?
marisa-trie - Static memory-efficient Trie-like structures for Python based on marisa-trie C++ library.
trie - Generic prefix tree for golang
vellichor - A useful collection of fast and lightweight data structures and their algorithms
Cadmium - Natural Language Processing (NLP) library for Crystal
java-algorithms-implementation - Algorithms and Data Structures implemented in Java
goblin - A golang http router based on trie tree.
buckets - A complete, fully tested and documented data structure library written in pure JavaScript.
hash-array-mapped-trie - A hash array mapped trie implementation in c.
java-immutable-collections - Efficient Immutable/Persistent Collections for Java
trie - Missing Trie implementation for Go
leetcode-swift - TOP 200 #Dev 🏆 LeetCode, Solutions in Swift, Shell, Database (T-SQL, PL/SQL, MySQL), Concurrency (Python3). @ S. Leschev. Google Engineering Level: L6+
libaca - C Library of Aho-Corasick Algorithm based on Coordinate Hash Trie