Struct VerificationGraph 

pub struct VerificationGraph {
    pub node_count: usize,
    pub edges: Vec<VerificationEdge>,
}

A verification graph over node_count local-state components.

Fields

node_count: usize

edges: Vec<VerificationEdge>

Implementations

impl VerificationGraph

pub fn new(node_count: usize) -> Self

pub fn with_edge(self, src: usize, dst: usize, weight: f64) -> Self

pub fn add_edge(&mut self, src: usize, dst: usize, weight: f64)

pub fn smallest_nonzero_eigenvalue(&self, tol: f64) -> Result<Option<f64>>

Smallest non-zero eigenvalue lambda_min+(A) of the Laplacian.

Returns None when the graph is disconnected or empty of edges (the spectral gap is then zero, so mu is not informative). Eigenvalues within tol of zero are treated as zero.

pub fn mu(&self, tol: f64) -> Result<Option<f64>>

The spectral energy-slope constant mu = 2 * lambda_min+(A).

Returns None for a disconnected verification graph, where the gap is zero and mu is uninformative (a disconnected verifier component cannot be driven to consensus by the others).

pub fn fiedler_value(&self, tol: f64) -> Result<Option<f64>>

Algebraic connectivity (Fiedler value) — the smallest non-zero eigenvalue; mu = 2 * fiedler.

pub fn edge_mu_sensitivity( &self, src: usize, dst: usize, weight: f64, tol: f64, ) -> Result<f64>

Change in mu produced by adding a candidate verifier edge.

An independent verifier that raises the spectral gap yields a positive delta; a redundant verifier that does not yields ~0. Used to distinguish independent from redundant verifiers (PSP-8 System 2).

Trait Implementations

impl Clone for VerificationGraph

fn clone(&self) -> VerificationGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for VerificationGraph

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

Formats the value using the given formatter.

impl Default for VerificationGraph

fn default() -> VerificationGraph

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for VerificationGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for VerificationGraph

fn eq(&self, other: &VerificationGraph) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for VerificationGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for VerificationGraph