42
shortest_path_finder
v0.1.1 ExperimentalA 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.
non-standard Edition 2024
Quick Verdict
- ✓Actively maintained (updated 14d ago)
- !Pre-1.0: API may have breaking changes
Security
Checking security advisories...
Downloads
28
Dependents
0
Releases
2
Size
35KB
Deep Insights
📊
Download activity
28 downloads in the last 30 days (1/day avg).
📐
Compact crate
At 34KB, shortest_path_finder is lightweight. Small crate size correlates with focused, well-scoped functionality.
Health Breakdown
Maintenance 13/25
Recency, release consistency, active ratio
Quality 13/25
Yanked ratio, deps, size, maturity, features
Community 6/20
Reverse deps, ownership, ecosystem
Popularity 2/15
Downloads, momentum, growth trend
Documentation 8/15
Docs, repo, license, metadata
Download Trend
Daily downloads · last 90 days
0/day avg
Version Adoption
v0.1.1
54%
v0.1.0
46%
Release Timeline
2 releasessince 2026
J
F
M
A
M
J
J
A
S
O
N
D
2026
2
LessMore
README
Loading README...
Maintainers
Dependencies
5
direct dependencies
Dependents
0
crates depend on shortest_path_finder