Struct CausalGraph 

pub struct CausalGraph { /* private fields */ }

A Directed Acyclic Graph (DAG) representing causal structure among variables.

Nodes are identified by string names; edges encode direct causal relationships (parent → child). The graph enforces acyclicity lazily via CausalGraph::is_acyclic.

Implementations

impl CausalGraph

pub fn new(nodes: Vec<String>) -> Self

Create a new causal graph with the given variable names.

pub fn node_index(&self, name: &str) -> Option<usize>

Return the index of a node by name, or None if it does not exist.

pub fn add_edge(&mut self, parent: &str, child: &str) -> Result<(), CausalError>

Add a directed edge parent → child.

Returns CausalError::NodeNotFound if either node is absent. Does not check for cycles — call CausalGraph::is_acyclic separately.

pub fn parents_of(&self, node: &str) -> Vec<String>

Return direct parents of node.

pub fn children_of(&self, node: &str) -> Vec<String>

Return direct children of node.

pub fn ancestors_of(&self, node: &str) -> Vec<String>

Return all ancestors of node (transitive parents), excluding the node itself.

pub fn descendants_of(&self, node: &str) -> Vec<String>

Return all descendants of node (transitive children), excluding the node itself.

pub fn is_acyclic(&self) -> bool

Check whether the graph is acyclic using Kahn’s BFS topological sort algorithm.

Returns true if the graph is a valid DAG.

pub fn nodes(&self) -> &[String]

Return all node names.

pub fn node_count(&self) -> usize

Return the number of nodes.

pub fn edge_count(&self) -> usize

Return the number of directed edges.

pub fn d_separated(&self, x: &str, y: &str, observed: &[&str]) -> bool

Test d-separation: is x d-separated from y given the observed set observed?

Uses the Bayes-Ball algorithm on the moral graph / active path traversal. A path is active given observed if:

• At every non-collider on the path, the node is NOT in observed.
• At every collider, the collider OR one of its descendants IS in observed.

pub fn has_directed_path(&self, src: &str, dst: &str) -> bool

Check whether there is a directed path from src to dst.

Trait Implementations

impl Clone for CausalGraph

fn clone(&self) -> CausalGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CausalGraph

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

Formats the value using the given formatter.