Struct FastPercolation 

pub struct FastPercolation { /* private fields */ }

Fast union-find data structure for rigidity percolation

Uses path compression and union by rank for efficient connectivity analysis of large graphs.

Implementations

impl FastPercolation

pub fn new(n: usize) -> Self

Creates a new percolation structure for n nodes

pub fn compute_rigidity( &mut self, edges: &[(usize, usize)], n_nodes: usize, ) -> RigidityResult

Computes rigidity metrics for a graph

Uses Laman’s theorem to determine if a graph is minimally rigid. A graph with V vertices is minimally rigid if it has exactly 2V-3 edges and every subgraph with k vertices has at most 2k-3 edges.

Arguments

• edges - Slice of (u, v) tuples representing edges
• n_nodes - Total number of nodes in the graph

Returns

RigidityResult containing comprehensive rigidity metrics