Struct UnionFindDecoder 

pub struct UnionFindDecoder { /* private fields */ }

Fast union-find based decoder with O(n * alpha(n)) complexity.

The algorithm:

1. Extract defects (syndrome bit flips between consecutive rounds).
2. Build a defect graph where edges connect nearby defects weighted by Manhattan distance.
3. Grow clusters from each defect using weighted union-find, merging clusters whose boundaries touch.
4. For each odd-parity cluster, assign Pauli corrections along the shortest path to the nearest boundary.

This is significantly faster than full MWPM while achieving near-optimal correction for moderate error rates (p < 1%).

Implementations

impl UnionFindDecoder

pub fn new(max_growth_radius: u32) -> Self

Create a new union-find decoder.

max_growth_radius controls how far clusters expand before we stop growing (typically set to code_distance / 2). If 0, defaults to code_distance at decode time.

Trait Implementations

impl SurfaceCodeDecoder for UnionFindDecoder

fn decode(&self, syndrome: &SyndromeData) -> Correction

Decode a syndrome and return the inferred correction.

fn name(&self) -> &str

Human-readable name for this decoder.