rustio rustio.net

Decision Workspace

shortest_path_finder

Side-by-side comparison of Rust crates

42
shortest_path_finder
experimentalv0.1.1

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.

Core Metrics

shortest_path_finder
Health Score42
Total Downloads28
30d Downloads28
Dependents0
Releases2
Last Updated14d ago
Age14d

Health Breakdown

shortest_path_finder
Maintenance
13
Quality
13
Community
6
Popularity
2
Documentation
8

Technical Details

shortest_path_finder
Version0.1.1
Stable (≥1.0)✗ No
Licensenon-standard
Dependencies5
Crate Size35KB
Features0
Yanked %0.0%
Edition2024
MSRV—
Owners1

Links

shortest_path_finder detail →GitHub ↗crates.io ↗

Quick Verdict

  • •shortest_path_finder leads with a health score of 42/100, but none of the options score above 80.