Decision Workspace
icentral-parallel-brandes vs icentral-test-brandes vs icentral-fast-brandes
Side-by-side comparison of Rust crates
33
icentral-parallel-brandes
experimentalv0.1.0
Efficient parallel computation of betweenness centrality using Brandes' algorithm in large graphs, leveraging Rust's concurrency model.
33
icentral-test-brandes
experimentalv0.1.0
icentral-test-brandes is a Rust library for computing betweenness centrality using Brandes' algorithm. It supports both bounded and unbounded iterations over graph structures efficiently, with precise timing.
33
icentral-fast-brandes
experimentalv0.1.0
Efficient Rust implementation of Brandes algorithm for computing betweenness centrality on graphs with support for complex structures.
Core Metrics
| icentral-parallel-brandes | icentral-test-brandes | icentral-fast-brandes | |
|---|---|---|---|
| Health Score | 33 | 33 | 33 |
| Total Downloads | 860 | 1.2K | 874 |
| 30d Downloads | 20 | 62 | 20 |
| Dependents | 1 | 2 | 1 |
| Releases | 1 | 1 | 1 |
| Last Updated | 357d ago | 357d ago | 357d ago |
| Age | 11m | 11m | 11m |
Health Breakdown
icentral-parallel-brandes
Maintenance
3
Quality
12
Community
7
Popularity
4
Documentation
7
icentral-test-brandes
Maintenance
3
Quality
12
Community
7
Popularity
4
Documentation
7
icentral-fast-brandes
Maintenance
3
Quality
12
Community
7
Popularity
4
Documentation
7
Technical Details
| icentral-parallel-brandes | icentral-test-brandes | icentral-fast-brandes | |
|---|---|---|---|
| Version | 0.1.0 | 0.1.0 | 0.1.0 |
| Stable (≥1.0) | ✗ No | ✗ No | ✗ No |
| License | MIT OR Apache-2.0 | MIT OR Apache-2.0 | MIT OR Apache-2.0 |
| Dependencies | 8 | 8 | 10 |
| Crate Size | 16KB | 17KB | 17KB |
| Features | 0 | 0 | 0 |
| Yanked % | 0.0% | 0.0% | 0.0% |
| Edition | 2021 | 2021 | 2021 |
| MSRV | — | — | — |
| Owners | 1 | 1 | 1 |
Links
Quick Verdict
- •icentral-parallel-brandes leads with a health score of 33/100, but none of the options score above 80.
- •icentral-test-brandes has the most downloads (1.2K), suggesting wider adoption.