Decision Workspace
icentral-path-counts vs dijkstra-suite vs yagraphc
Side-by-side comparison of Rust crates
37
icentral-path-counts
growingv0.1.0
A crate for managing path counts of nodes in graph-like structures, designed for efficient performance in computational graph analysis.
49
dijkstra-suite
experimentalv0.1.0-alpha.1
A Dijkstra's algorithm implementation that aims to be simple to use and fast to run
40
yagraphc
growingv0.1.2
Crate for working with Graph data structures and common algorithms on top of it.
Core Metrics
| icentral-path-counts | dijkstra-suite | yagraphc | |
|---|---|---|---|
| Health Score | 37 | 49 | 40 |
| Total Downloads | 5.4K | 26 | 4.0K |
| 30d Downloads | 0 | 0 | 0 |
| Dependents | 9 | 0 | 0 |
| Releases | 1 | 2 | 3 |
| Last Updated | 416d ago | 2d ago | 869d ago |
| Age | 1y 1m | 3d | 2y 4m |
Health Breakdown
icentral-path-counts
Maintenance
2
Quality
15
Community
9
Popularity
4
Documentation
7
dijkstra-suite
Maintenance
14
Quality
15
Community
5
Popularity
2
Documentation
13
yagraphc
Maintenance
5
Quality
15
Community
6
Popularity
4
Documentation
10
Technical Details
| icentral-path-counts | dijkstra-suite | yagraphc | |
|---|---|---|---|
| Version | 0.1.0 | 0.1.0-alpha.1 | 0.1.2 |
| Stable (≥1.0) | ✗ No | ✗ No | ✗ No |
| License | MIT OR Apache-2.0 | GPL-3.0 | MIT |
| Dependencies | 3 | 0 | 1 |
| Crate Size | 15KB | 15KB | 12KB |
| Features | 0 | 0 | 0 |
| Yanked % | 0.0% | 0.0% | 0.0% |
| Edition | 2021 | 2024 | 2021 |
| MSRV | — | — | — |
| Owners | 1 | 1 | 1 |
Links
Quick Verdict
- •dijkstra-suite leads with a health score of 49/100, but none of the options score above 80.
- •icentral-path-counts has the most downloads (5.4K), suggesting wider adoption.
- •⚠ icentral-path-counts, yagraphc have not been updated in over a year.