Graph Adjustment Identification Distances for Causal Graphs R package gadjid version 0.1.0 Make efficient Rust implementations of graph adjustment identification distances available in R. These distances (based on ancestor, optimal, and parent adjustment) count how often the respective adjustment identification strategy leads to causal inferences that are incorrect relative to a ground-truth graph when applied to a candidate graph instead. See also Henckel, Würtzen, Weichwald (2024) <doi:10.48550/arXiv.2402.08616>. Software Depends: R (>= 4.2) Suggests: testthat (>= 3.0.0) Sebastian Weichwald <sweichwald@math.ku.dk> Comprehensive R Archive Network (CRAN) Sebastian Weichwald [aut, cph, cre], Theo Würtzen [aut], Leonard Henckel [aut], Authors of the dependency Rust crates [ctb] (see inst/AUTHORS file for details) MPL 2025-08-29 application/tgz https://CRAN.R-project.org/package=gadjid doi:10.32614/CRAN.package.gadjid