grid_search_cardinal_best 0.1.0

Search algorithm for finding the shortest path to the best cell in a uniform-cost cardinal grid
Documentation
[dependencies.coord_2d]
version = "0.2"

[dependencies.direction]
version = "0.17"

[dependencies.grid_search_cardinal_common]
version = "0.1"

[dependencies.serde]
features = ["serde_derive"]
optional = true
version = "1.0"
[dev-dependencies.coord_2d]
features = ["rand"]
version = "0.2"

[dev-dependencies.grid_2d]
version = "0.14"

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

[dev-dependencies.rand_isaac]
version = "0.2"

[features]
serialize = ["serde", "coord_2d/serialize"]

[package]
authors = ["Stephen Sherratt <stephen@sherra.tt>"]
description = "Search algorithm for finding the shortest path to the best cell in a uniform-cost cardinal grid"
documentation = "https://docs.rs/grid_search_cardinal_best"
edition = "2018"
homepage = "https://github.com/stevebob/grid-search.git"
license = "MIT"
name = "grid_search_cardinal_best"
readme = "README.md"
repository = "https://github.com/stevebob/grid-search.git"
version = "0.1.0"