[package]
edition = "2021"
name = "icentral-scratch"
version = "0.1.0"
build = false
autolib = false
autobins = false
autoexamples = false
autotests = false
autobenches = false
description = "Graph-theoretic crate for finding biconnected components and calculating betweenness centrality optimized by identifying articulation points."
readme = "README.md"
keywords = [
"biconnectedcomponent",
"graphtheory",
"betweennesscentralit",
"algorithms",
"articulationpoints",
]
categories = [
"algorithms",
"data-structures",
"science",
"mathematics",
"simulation",
]
license = "MIT OR Apache-2.0"
[lib]
name = "icentral_scratch"
path = "src/lib.rs"
[dependencies.icentral-3p]
version = "0.1.0"
[dependencies.icentral-articulation-point-map]
version = "0.1.0"
[dependencies.icentral-edge]
version = "0.1.0"
[dependencies.icentral-edges]
version = "0.1.0"
[dependencies.icentral-errors]
version = "0.1.0"
[dependencies.icentral-graph-interface]
version = "0.1.0"
[dependencies.icentral-neighbors]
version = "0.1.0"
[dependencies.icentral-nodeid]
version = "0.1.0"
[dependencies.icentral-pair-dependencies]
version = "0.1.0"
[dependencies.icentral-parents-map]
version = "0.1.0"
[dependencies.icentral-scores]
version = "0.1.0"
[dependencies.icentral-sigmas]
version = "0.1.0"
[dependencies.icentral-subgraph]
version = "0.1.0"
[dependencies.named-item]
version = "0.1.0"
[dependencies.renew-traits]
version = "0.1.0"