Module network_reliability 

Network reliability algorithms: Monte Carlo estimation, exact BDD computation, inclusion-exclusion polynomial, and component failure enumeration.

Algorithms

• Monte Carlo two-terminal reliability: sample edge subsets, check connectivity.
• Monte Carlo all-terminal reliability: check full graph connectivity.
• ReliabilityPolynomial: exact polynomial coefficients via inclusion-exclusion on spanning trees / path enumeration (feasible for |E| ≤ 20).
• BDD (Binary Decision Diagram): exact reliability for small networks via ordered BDDs over edge variables.
• ComponentFailureTree: ball-tree style structure for enumerating minimal cuts / paths.

Structs

AllTerminalReliability

All-terminal network reliability estimator.

BDD

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

ComponentFailureTree

Ball-tree style structure for enumerating component failure modes.

FailureNode

A node in the component failure tree.

NetworkReliability

Two-terminal network reliability estimator.

ReliabilityPolynomial

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