shortest_path_finder

v0.3.1crates.io· Rust

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.

The verdict

Maintained. Niche but maintained, actively maintained.

Live from the crates.io registry · derived rules, not AI

How it scores

MaintenanceHealthy

PopularityNiche

SecurityClean

LicenseOther

DepsZero deps

Maintenance

Last published 1 month ago.

Popularity

5 downloads / week

Security

No known advisories for this version (OSV).

License

non-standard

Dependencies

No runtime dependencies

Recent releases

0.3.11 month ago
0.3.01 month ago
0.2.01 month ago
0.1.13 months ago
0.1.03 months ago