Struct CausalGraph 

pub struct CausalGraph {
    pub num_nodes: usize,
    /* private fields */
}

Directed graph representing causal relationships

Fields

num_nodes: usize

Number of nodes (event types)

Implementations

impl CausalGraph

pub fn new(num_nodes: usize) -> Self

Create a new empty causal graph

pub fn add_edge( &mut self, source: usize, target: usize, strength: f64, relation: CausalRelation, )

Add a causal edge

pub fn edges_from(&self, source: usize) -> &[(usize, f64, CausalRelation)]

Get edges from a node

pub fn edges(&self) -> &[CausalEdge]

Get all edges

pub fn transitive_closure(&self) -> Self

Compute transitive closure (indirect causation)

Uses Floyd-Warshall algorithm with O(n³) complexity. Limited to MAX_CLOSURE_NODES to prevent DoS.

pub fn reachable_from(&self, source: usize) -> HashSet<usize>

Find nodes reachable from a source

pub fn to_undirected(&self) -> DynamicGraph

Convert to undirected graph for mincut analysis

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.