Decision Workspace
icentral-cycle vs shortest_path_finder vs lineic
Side-by-side comparison of Rust crates
35
icentral-cycle
growingv0.1.0
This crate provides tools to represent and compute the Minimum Cycle Basis of a graph, offering efficient access and manipulation of cycles for algorithmic and theoretical analysis.
51
shortest_path_finder
experimentalv0.3.3
A Rust library for shortest path finding algorithms, including Dijkstra's, A*, and Bellman-Ford. Supports both directed and undirected graphs, with customizable heuristics and edge weights. Ideal for game development, network routing, and graph analysis.
47
lineic
growingv0.4.0
Flexible linear interpolator for Rust
Core Metrics
| icentral-cycle | shortest_path_finder | lineic | |
|---|---|---|---|
| Health Score | 35 | 51 | 47 |
| Total Downloads | 8.0K | 125 | 3.1K |
| 30d Downloads | 0 | 0 | 0 |
| Dependents | 6 | 0 | 0 |
| Releases | 1 | 7 | 4 |
| Last Updated | 553d ago | 34d ago | 639d ago |
| Age | 1y 6m | 7m | 1y 9m |
Health Breakdown
icentral-cycle
Maintenance
1
Quality
14
Community
8
Popularity
5
Documentation
7
shortest_path_finder
Maintenance
18
Quality
12
Community
6
Popularity
3
Documentation
12
lineic
Maintenance
10
Quality
17
Community
6
Popularity
4
Documentation
10
Technical Details
| icentral-cycle | shortest_path_finder | lineic | |
|---|---|---|---|
| Version | 0.1.0 | 0.3.3 | 0.4.0 |
| Stable (≥1.0) | ✗ No | ✗ No | ✗ No |
| License | MIT OR Apache-2.0 | MIT | MIT OR Apache-2.0 |
| Dependencies | 5 | 9 | 0 |
| Crate Size | 16KB | 84KB | 12KB |
| Features | 0 | 0 | 1 |
| Yanked % | 0.0% | 0.0% | 0.0% |
| Edition | 2021 | 2024 | 2021 |
| MSRV | — | 1.88.0 | — |
| Owners | 1 | 1 | 1 |
Links
Quick Verdict
- •shortest_path_finder leads with a health score of 51/100, but none of the options score above 80.
- •icentral-cycle has the most downloads (8.0K), suggesting wider adoption.
- •⚠ icentral-cycle, lineic have not been updated in over a year.