Struct GraphicalSeparation

pub struct GraphicalSeparation<'a, G, D>
where
    G: BaseGraph<Direction = D>,
{ /* private fields */ }

Graphical independence struct

Implementations

impl<'a, G, D> GraphicalSeparation<'a, G, D>

where G: BaseGraph<Direction = D>,

pub const fn new(g: &'a G) -> Self

Build a new graphical independence struct.

Panics

If $\mathbf{X}$, $\mathbf{Y}$ and $\mathbf{Z}$ are not disjoint subsets of $\mathbf{V}$.

Examples

use causal_hub::prelude::*;

// Build a new directed graph.
let g = DiGraph::new(
    ["A", "B", "C", "D", "E", "F"],
    [
        ("A", "C"),
        ("B", "C"),
        ("C", "D"),
        ("C", "E"),
    ]
);

// Build d-separation query struct.
let q = GSeparation::from(&g);

// Assert A _||_ B | { } .
assert!(q.are_independent([0], [1], []));
// Assert A _||_ B | { C } .
assert!(!q.are_independent([0], [1], [2]));
// Assert A _||_ D | { } .
assert!(!q.are_independent([0], [3], []));
// Assert A _||_ D | { C } .
assert!(q.are_independent([0], [3], [2]));
// Assert { A, B } _||_ { D, E } | { C } .
assert!(q.are_independent([0, 1], [3, 4], [2]));

Trait Implementations

impl<'a, G, D: Clone> Clone for GraphicalSeparation<'a, G, D>

where G: BaseGraph<Direction = D> + Clone,

fn clone(&self) -> GraphicalSeparation<'a, G, D>

Returns a duplicate of the value.

const fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'a, G, D: Debug> Debug for GraphicalSeparation<'a, G, D>

where G: BaseGraph<Direction = D> + Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'a, G, D> From<&'a G> for GraphicalSeparation<'a, G, D>

where G: BaseGraph<Direction = D>,

fn from(g: &'a G) -> Self

Converts to this type from the input type.

impl<'a, G> GeneralizedIndependence for GraphicalSeparation<'a, G, Directed>

where G: DirectedGraph<Direction = Directed> + MoralGraph,

fn are_independent<I, J, K>(&self, x: I, y: J, z: K) -> bool

where I: IntoIterator<Item = usize>, J: IntoIterator<Item = usize>, K: IntoIterator<Item = usize>,

Checks whether $\mathbf{X} \mathrlap{\thinspace\perp}{\perp}_{\mathcal{G}} \mathbf{Y} \mid \mathbf{Z}$ holds or not.

impl<'a, G> GeneralizedIndependence for GraphicalSeparation<'a, G, Undirected>

where G: UndirectedGraph<Direction = Undirected>,

fn are_independent<I, J, K>(&self, x: I, y: J, z: K) -> bool

where I: IntoIterator<Item = usize>, J: IntoIterator<Item = usize>, K: IntoIterator<Item = usize>,

Checks whether $\mathbf{X} \mathrlap{\thinspace\perp}{\perp}_{\mathcal{G}} \mathbf{Y} \mid \mathbf{Z}$ holds or not.

impl<'a, G> Independence for GraphicalSeparation<'a, G, Directed>

where G: DirectedGraph<Direction = Directed> + MoralGraph,

fn is_independent(&self, x: usize, y: usize, z: &[usize]) -> bool

Checks whether $\mathbf{X} \mathrlap{\thinspace\perp}{\perp} \mathbf{Y} \mid \mathbf{Z}$ holds or not.

impl<'a, G> Independence for GraphicalSeparation<'a, G, Undirected>

where G: UndirectedGraph<Direction = Undirected>,

fn is_independent(&self, x: usize, y: usize, z: &[usize]) -> bool

Checks whether $\mathbf{X} \mathrlap{\thinspace\perp}{\perp} \mathbf{Y} \mid \mathbf{Z}$ holds or not.