Decision Workspace
dijkstra-adjacency-list vs pathfinding vs bit_gossip
Side-by-side comparison of Rust crates
34
dijkstra-adjacency-list
experimentalv0.1.0
Dijkstra algorithm implmentation using adjacency list.
69
pathfinding
stablev4.15.0
Pathfinding, flow, and graph algorithms
56
bit_gossip
growingv0.0.13
Pathfinding library for calculating all node pairs' shortest paths in an unweighted undirected graph.
Core Metrics
| dijkstra-adjacency-list | pathfinding | bit_gossip | |
|---|---|---|---|
| Health Score | 34 | 69 | 56 |
| Total Downloads | 29 | 2.0M | 13.7K |
| 30d Downloads | 3 | 97.6K | 17 |
| Dependents | 0 | 487 | 0 |
| Releases | 1 | 133 | 13 |
| Last Updated | 138d ago | 17d ago | 597d ago |
| Age | 4m | 9y 3m | 1y 7m |
Health Breakdown
dijkstra-adjacency-list
Maintenance
6
Quality
13
Community
6
Popularity
2
Documentation
7
pathfinding
Maintenance
18
Quality
16
Community
12
Popularity
8
Documentation
15
bit_gossip
Maintenance
13
Quality
17
Community
6
Popularity
5
Documentation
15
Technical Details
| dijkstra-adjacency-list | pathfinding | bit_gossip | |
|---|---|---|---|
| Version | 0.1.0 | 4.15.0 | 0.0.13 |
| Stable (≥1.0) | ✗ No | ✓ Yes | ✗ No |
| License | MIT | Apache-2.0/MIT | MIT OR Apache-2.0 |
| Dependencies | 0 | 16 | 3 |
| Crate Size | 1.2MB | 182KB | 29KB |
| Features | 0 | 1 | 2 |
| Yanked % | 0.0% | 1.5% | 0.0% |
| Edition | 2024 | 2024 | 2021 |
| MSRV | — | 1.87.0 | 1.56 |
| Owners | 1 | 1 | 1 |
Links
Quick Verdict
- •pathfinding leads with a health score of 69/100, but none of the options score above 80.
- •pathfinding is depended on by 487 crates — strongest ecosystem trust.
- •⚠ bit_gossip has not been updated in over a year.
- •dijkstra-adjacency-list, bit_gossip are pre-1.0 — API may change.