[package]
edition = "2024"
name = "gryf"
version = "0.2.1"
authors = ["Petr Nevyhoštěný"]
build = false
autolib = false
autobins = false
autoexamples = false
autotests = false
autobenches = false
description = "Graph data structure library with focus on convenience, versatility, correctness and performance."
homepage = "https://github.com/pnevyk/gryf"
documentation = "https://docs.rs/gryf"
readme = "README.md"
keywords = [
"graph",
"algorithms",
"data-structures",
]
categories = [
"algorithms",
"data-structures",
]
license = "MIT OR Unlicense"
repository = "https://github.com/pnevyk/gryf"
resolver = "2"
[features]
arbitrary = ["dep:arbitrary"]
default = []
derive = []
proptest = ["dep:proptest"]
[lib]
name = "gryf"
path = "src/lib.rs"
[[example]]
name = "chessboard"
path = "examples/chessboard.rs"
[[example]]
name = "implicit_graph"
path = "examples/implicit_graph.rs"
[[example]]
name = "shortest_path"
path = "examples/shortest_path.rs"
[[example]]
name = "smaller_id"
path = "examples/smaller_id.rs"
[[example]]
name = "specific_storage"
path = "examples/specific_storage.rs"
[[bench]]
name = "basic_ops"
path = "benches/basic_ops.rs"
harness = false
[[bench]]
name = "common"
path = "benches/common.rs"
[[bench]]
name = "shortest_paths"
path = "benches/shortest_paths.rs"
harness = false
[[bench]]
name = "toposort"
path = "benches/toposort.rs"
harness = false
[dependencies.arbitrary]
version = "1.2.3"
features = ["derive"]
optional = true
[dependencies.bitvec]
version = "1.0.1"
[dependencies.fixedbitset]
version = "0.5.7"
[dependencies.gryf-derive]
version = "=0.2.1"
[dependencies.indexmap]
version = "2.11.0"
[dependencies.proptest]
version = "1.1.0"
optional = true
[dependencies.rustc-hash]
version = "2.1.1"
[dependencies.thiserror]
version = "2.0.16"
[dev-dependencies.assert_matches]
version = "1.5.0"
[dev-dependencies.divan]
version = "0.1.14"
[dev-dependencies.fastrand]
version = "2.1.0"
[dev-dependencies.petgraph]
version = "0.8.2"