Package: gadjid 0.1.0

gadjid: Graph Adjustment Identification Distances for Causal Graphs

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>.

Authors:Sebastian Weichwald [aut, cph, cre], Theo Würtzen [aut], Leonard Henckel [aut], Authors of the dependency Rust crates [ctb]