Decision Workspace
aph_disjoint_set vs incremental-tree-set-union vs reunion
Side-by-side comparison of Rust crates
43
aph_disjoint_set
growingv0.1.1
Disjoint set implementation with optimized memory usage and ability to detach elements.
48
incremental-tree-set-union
experimentalv0.1.1
Gabow-Tarjan linear-time algorithm for incremental tree set union (JCSS 1985)
45
reunion
growingv0.1.14
A generic implementation of the Union-Find w/ Rank data structure.
Core Metrics
| aph_disjoint_set | incremental-tree-set-union | reunion | |
|---|---|---|---|
| Health Score | 43 | 48 | 45 |
| Total Downloads | 3.4K | 22 | 17.5K |
| 30d Downloads | 54 | 22 | 32 |
| Dependents | 0 | 0 | 0 |
| Releases | 2 | 2 | 14 |
| Last Updated | 1014d ago | 5d ago | 1650d ago |
| Age | 2y 9m | 6d | 4y 6m |
Health Breakdown
aph_disjoint_set
Maintenance
4
Quality
15
Community
5
Popularity
4
Documentation
15
incremental-tree-set-union
Maintenance
14
Quality
14
Community
6
Popularity
2
Documentation
12
reunion
Maintenance
12
Quality
15
Community
3
Popularity
5
Documentation
10
Technical Details
| aph_disjoint_set | incremental-tree-set-union | reunion | |
|---|---|---|---|
| Version | 0.1.1 | 0.1.1 | 0.1.14 |
| Stable (≥1.0) | ✗ No | ✗ No | ✗ No |
| License | MIT OR Apache-2.0 | MIT | non-standard |
| Dependencies | 2 | 6 | 3 |
| Crate Size | 28KB | 106KB | 6KB |
| Features | 0 | 2 | 0 |
| Yanked % | 0.0% | 0.0% | 0.0% |
| Edition | 2021 | 2024 | 2018 |
| MSRV | 1.70 | 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.
- •⚠ aph_disjoint_set, reunion have not been updated in over a year.