Decision Workspace
hill_descent_lib vs graphmind-optimization vs u-metaheur
Side-by-side comparison of Rust crates
48
hill_descent_lib
experimentalv0.3.1
Genetic algorithm library for n-dimensional optimization problems
53
graphmind-optimization
experimentalv0.8.5
High-performance metaheuristic optimization algorithms (Jaya, Rao, TLBO, BMR, BWR, QOJaya, ITLBO) in Rust.
47
u-metaheur
experimentalv0.2.0
Domain-agnostic metaheuristic optimization framework: GA, BRKGA, SA, ALNS.
Core Metrics
| hill_descent_lib | graphmind-optimization | u-metaheur | |
|---|---|---|---|
| Health Score | 48 | 53 | 47 |
| Total Downloads | 187 | 147 | 81 |
| 30d Downloads | 6 | 147 | 58 |
| Dependents | 0 | 20 | 7 |
| Releases | 4 | 10 | 2 |
| Last Updated | 38d ago | today | 19d ago |
| Age | 5m | 7d | 1m |
Health Breakdown
hill_descent_lib
Maintenance
17
Quality
12
Community
6
Popularity
3
Documentation
10
graphmind-optimization
Maintenance
17
Quality
13
Community
10
Popularity
3
Documentation
10
u-metaheur
Maintenance
13
Quality
14
Community
8
Popularity
2
Documentation
10
Technical Details
| hill_descent_lib | graphmind-optimization | u-metaheur | |
|---|---|---|---|
| Version | 0.3.1 | 0.8.5 | 0.2.0 |
| Stable (≥1.0) | ✗ No | ✗ No | ✗ No |
| License | MIT OR Apache-2.0 | Apache-2.0 | MIT |
| Dependencies | 14 | 7 | 9 |
| Crate Size | 153KB | 26KB | 69KB |
| Features | 1 | 0 | 4 |
| Yanked % | 0.0% | 0.0% | 0.0% |
| Edition | 2024 | 2021 | 2021 |
| MSRV | — | — | — |
| Owners | 1 | 1 | 1 |
Links
Quick Verdict
- •graphmind-optimization leads with a health score of 53/100, but none of the options score above 80.
- •hill_descent_lib has the most downloads (187), suggesting wider adoption.