floyd-warshall 0.0.3

Efficient all-pairs-shortest-paths algorithm for the petgraph library using the floyd-warshall algorithm.
Documentation
# THIS FILE IS AUTOMATICALLY GENERATED BY CARGO
#
# When uploading crates to the registry Cargo will automatically
# "normalize" Cargo.toml files for maximal compatibility
# with all versions of Cargo and also rewrite `path` dependencies
# to registry (e.g. crates.io) dependencies
#
# If you believe there's an error in this file please file an
# issue against the rust-lang/cargo repository. If you're
# editing this file be aware that the upstream Cargo.toml
# will likely look very different (and much more reasonable)

[package]
name = "floyd-warshall"
version = "0.0.3"
authors = ["Marvin Böcker <marvin.boecker@tu-dortmund.de>"]
description = "Efficient all-pairs-shortest-paths algorithm for the petgraph library using the floyd-warshall algorithm."
documentation = "https://docs.rs/floyd-warshall"
readme = "README.md"
keywords = ["floyd", "warshall", "graph", "petgraph", "asap"]
license = "MIT"
repository = "https://github.com/zombiemuffin/floyd-warshall/"
[dependencies.petgraph]
version = "0.4.10"
[dev-dependencies.rand]
version = "0.3.17"

[dev-dependencies.text_io]
version = "0.1.6"