This small crate provides the required utilities for constructing a graph from a list of edges and also provides an implementation of Dijkstra's shortest path algorithm for finding the shortest route through a weighted graph.
To quickly build and run the crate use: cargo run
To build a release executable use: cargo build --release
To run tests and verify that any modifications to the code have not introduced regressions use: cargo test
Build and launch documentation: cargo doc --open
- Condense, polish and refine code
- Profile code for performance and optimize
- Incorporate this crate into a larger, graphical piston project with a path-finding AI