[[bench]]
harness = false
name = "my_benchmark"
[dependencies.hashbrown]
version = "0.11"
[dependencies.log]
optional = true
version = "0.4"
[dependencies.rayon]
optional = true
version = "1.5"
[dev-dependencies.criterion]
version = "0.3"
[dev-dependencies.env_logger]
version = "0.8"
[dev-dependencies.log]
version = "0.4"
[dev-dependencies.nanorand]
version = "0.6"
[features]
default = ["parallel"]
parallel = ["rayon", "hashbrown/rayon"]
[package]
authors = ["mich101mich <mich101mich@gmail.com>"]
categories = ["algorithms"]
description = "Quickly approximate Paths on a Grid"
edition = "2018"
exclude = ["/.github/*", "/.vscode/*", "/img/*", "/.gitignore"]
keywords = ["pathfinding", "dijkstra", "a-star", "grid"]
license = "MIT"
name = "hierarchical_pathfinding"
readme = "readme.md"
repository = "https://github.com/mich101mich/hierarchical_pathfinding"
version = "0.5.0"