Struct ReliabilityPolynomial 

pub struct ReliabilityPolynomial {
    pub coeffs: Vec<u64>,
    pub num_edges: usize,
    pub num_nodes: usize,
}

Exact reliability polynomial for small networks (|E| ≤ 20).

For a network where all edges have the same survival probability p, the all-terminal reliability is a polynomial in p:

R(p) = Σ_{k=0}^{m} c_k p^k (1−p)^{m−k}

where c_k is the number of edge subsets of size k that make the graph connected. This struct computes the coefficient vector [c_0, c_1, …, c_m] by exhaustive enumeration and stores it for fast evaluation at any p.

Fields

coeffs: Vec<u64>

Coefficients: coeffs[k] = number of connected edge subsets of size k.

num_edges: usize

Total number of edges.

num_nodes: usize

Number of nodes.

Implementations

impl ReliabilityPolynomial

pub fn compute(adj: &Array2<f64>) -> Result<Self>

Compute the reliability polynomial for a graph where all edges have equal survival probability.

Only feasible for |E| ≤ 20.

pub fn evaluate(&self, p: f64) -> f64

Evaluate the reliability polynomial at survival probability p.

R(p) = Σ_k c_k * p^k * (1−p)^{m−k}

pub fn min_connected_edges(&self) -> usize

Return the minimum cut size (the lowest k with coeffs[k] > 0).

pub fn total_connected_subgraphs(&self) -> u64

Return the total number of spanning subgraphs (sum of all coefficients).

Trait Implementations

impl Clone for ReliabilityPolynomial

fn clone(&self) -> ReliabilityPolynomial

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ReliabilityPolynomial

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

Formats the value using the given formatter.