Struct BDD 

pub struct BDD { /* private fields */ }

Binary Decision Diagram (BDD) for exact network reliability computation.

Represents the reliability function as an ordered BDD over edge boolean variables. Each variable x_e = 1 means edge e is functioning.

The BDD is built by Shannon expansion on each edge variable in order:

• Set x_e = 1 (edge alive): recurse on remaining problem.
• Set x_e = 0 (edge failed): recurse.
• Merge isomorphic subgraphs (unique table) for compactness.

Reliability is computed by a single bottom-up traversal weighting each path by p_e^{x_e} (1−p_e)^{1−x_e}.

Implementations

impl BDD

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

Build a BDD for all-terminal reliability.

Only feasible for |E| ≤ 20.

pub fn reliability(&self, probs: &[f64]) -> Result<f64>

Compute the all-terminal reliability R = E[connected(G_p)] using the BDD.

Arguments

• probs — survival probability for each edge, in the same order as the adjacency matrix edge enumeration (upper-triangle, row-major).

pub fn size(&self) -> usize

Return the number of BDD nodes (size of the diagram).

pub fn num_edges(&self) -> usize

Return the number of edges in the underlying network.

pub fn num_network_nodes(&self) -> usize

Return the number of nodes in the underlying network.

Trait Implementations

impl Debug for BDD

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

Formats the value using the given formatter.