Decision Workspace
disjoint-hash-set vs reunion vs incremental-tree-set-union
Side-by-side comparison of Rust crates
42
disjoint-hash-set
growingv1.0.0
A disjoint set / union-find data structure suitable for incremental tracking of connected component identified by their hash.
45
reunion
growingv0.1.14
A generic implementation of the Union-Find w/ Rank data structure.
48
incremental-tree-set-union
experimentalv0.1.1
Gabow-Tarjan linear-time algorithm for incremental tree set union (JCSS 1985)
Core Metrics
| disjoint-hash-set | reunion | incremental-tree-set-union | |
|---|---|---|---|
| Health Score | 42 | 45 | 48 |
| Total Downloads | 12.2K | 17.5K | 22 |
| 30d Downloads | 1.7K | 33 | 22 |
| Dependents | 0 | 0 | 0 |
| Releases | 1 | 14 | 2 |
| Last Updated | 1380d ago | 1650d ago | 5d ago |
| Age | 3y 9m | 4y 6m | 6d |
Health Breakdown
disjoint-hash-set
Maintenance
1
Quality
21
Community
5
Popularity
5
Documentation
10
reunion
Maintenance
12
Quality
15
Community
3
Popularity
5
Documentation
10
incremental-tree-set-union
Maintenance
14
Quality
14
Community
6
Popularity
2
Documentation
12
Technical Details
| disjoint-hash-set | reunion | incremental-tree-set-union | |
|---|---|---|---|
| Version | 1.0.0 | 0.1.14 | 0.1.1 |
| Stable (≥1.0) | ✓ Yes | ✗ No | ✗ No |
| License | CC0-1.0 | non-standard | MIT |
| Dependencies | 0 | 3 | 6 |
| Crate Size | 6KB | 6KB | 106KB |
| Features | 0 | 0 | 2 |
| Yanked % | 0.0% | 0.0% | 0.0% |
| Edition | 2021 | 2018 | 2024 |
| MSRV | — | — | 1.85 |
| Owners | 1 | 1 | 1 |
Links
Quick Verdict
- •incremental-tree-set-union leads with a health score of 48/100, but none of the options score above 80.
- •reunion has the most downloads (17.5K), suggesting wider adoption.
- •⚠ disjoint-hash-set, reunion have not been updated in over a year.
- •reunion, incremental-tree-set-union are pre-1.0 — API may change.