Decision Workspace
shortest_path_finder vs pofk_algorithm vs babbel_json
Side-by-side comparison of Rust crates
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.
38
pofk_algorithm
growingv0.0.3
A collection of efficient algorithms implemented in Rust for real-world projects.
57
babbel_json
experimentalv0.2.2
Fast, modular JSON toolkit with streaming parsers, JSON Pointer (RFC 6901), and Merge Patch
Core Metrics
| shortest_path_finder | pofk_algorithm | babbel_json | |
|---|---|---|---|
| Health Score | 51 | 38 | 57 |
| Total Downloads | 125 | 972 | 153 |
| 30d Downloads | 0 | 0 | 0 |
| Dependents | 0 | 0 | 10 |
| Releases | 7 | 3 | 6 |
| Last Updated | 34d ago | 425d ago | 21d ago |
| Age | 7m | 1y 2m | 1m |
Health Breakdown
shortest_path_finder
Maintenance
18
Quality
12
Community
6
Popularity
3
Documentation
12
pofk_algorithm
Maintenance
6
Quality
9
Community
6
Popularity
4
Documentation
13
babbel_json
Maintenance
15
Quality
15
Community
9
Popularity
3
Documentation
15
Technical Details
| shortest_path_finder | pofk_algorithm | babbel_json | |
|---|---|---|---|
| Version | 0.3.3 | 0.0.3 | 0.2.2 |
| Stable (≥1.0) | ✗ No | ✗ No | ✗ No |
| License | MIT | MIT | MIT |
| Dependencies | 9 | 2 | 5 |
| Crate Size | 84KB | 59KB | 133KB |
| Features | 0 | 0 | 9 |
| Yanked % | 0.0% | 66.7% | 0.0% |
| Edition | 2024 | 2024 | 2024 |
| MSRV | 1.88.0 | — | 1.85.0 |
| Owners | 1 | 1 | 1 |
Links
Quick Verdict
- •babbel_json leads with a health score of 57/100, but none of the options score above 80.
- •pofk_algorithm has the most downloads (972), suggesting wider adoption.
- •⚠ pofk_algorithm has not been updated in over a year.