Struct ComponentFailureTree 

pub struct ComponentFailureTree {
    pub root: FailureNode,
    pub minimal_cuts: Vec<Vec<usize>>,
    pub num_edges: usize,
    pub num_nodes: usize,
}

Ball-tree style structure for enumerating component failure modes.

Builds a tree where each level introduces one additional edge failure. The tree branches at each node for each remaining edge that could fail. This is useful for computing minimal cuts and identifying the most likely failure scenarios.

Fields

root: FailureNode

Root of the failure tree.

minimal_cuts: Vec<Vec<usize>>

All minimal cuts found during tree construction.

num_edges: usize

Number of edges.

num_nodes: usize

Number of nodes.

Implementations

impl ComponentFailureTree

pub fn build(adj: &Array2<f64>, max_depth: usize) -> Result<Self>

Build the component failure tree for a network up to max_depth edge failures.

Arguments

• adj — weighted adjacency matrix.
• max_depth — maximum number of simultaneous edge failures to consider.

max_depth should be kept small (≤ 5) for efficiency.

pub fn minimal_cuts(&self) -> &[Vec<usize>]

Return all minimal cuts found during tree construction.

pub fn unreliability_upper_bound(&self) -> f64

Compute total probability of disconnection up to max_depth failures.

This sums probabilities of all failure sets that are cuts, but avoids double-counting by only summing minimal cuts’ exact set probabilities.

Trait Implementations

impl Debug for ComponentFailureTree

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

Formats the value using the given formatter.