pathfinding 1.1.2

Pathfinding, flow, and graph algorithms
Documentation
[[bench]]
harness = false
name = "algos"

[[bench]]
harness = false
name = "algos-fill"

[[bench]]
harness = false
name = "movingai"
[badges.appveyor]
repository = "samueltardieu/pathfinding"

[badges.travis-ci]
repository = "samueltardieu/pathfinding"
[dependencies.fixedbitset]
version = "0.1.9"

[dependencies.indexmap]
version = "1.0.2"

[dependencies.itertools]
version = "0.7"

[dependencies.num-traits]
version = "0.2"
[dev-dependencies.criterion]
version = "0.2"

[dev-dependencies.lazy_static]
version = "1.0.0"

[dev-dependencies.movingai]
version = "0.7.0"

[dev-dependencies.noisy_float]
version = "0.1.5"

[dev-dependencies.rand]
version = "0.6"

[dev-dependencies.rand_xorshift]
version = "0.1.0"

[package]
authors = ["Samuel Tardieu <sam@rfc1149.net>"]
categories = ["algorithms"]
description = "Pathfinding, flow, and graph algorithms"
documentation = "https://docs.rs/pathfinding/"
edition = "2018"
homepage = "https://rfc1149.net/devel/pathfinding.html"
keywords = ["shortest-path", "astar", "dijkstra", "flow", "graph"]
license = "Apache-2.0/MIT"
name = "pathfinding"
readme = "README.md"
repository = "https://github.com/samueltardieu/pathfinding"
version = "1.1.2"