Struct IntermediateMatching 

pub struct IntermediateMatching {
    pub peer_matchings: Vec<((DualNodePtr, DualNodeWeak), (DualNodePtr, DualNodeWeak))>,
    pub virtual_matchings: Vec<((DualNodePtr, DualNodeWeak), VertexIndex)>,
}

Fields

peer_matchings: Vec<((DualNodePtr, DualNodeWeak), (DualNodePtr, DualNodeWeak))>

matched pairs; note that each pair will only appear once. (node_1, touching_1), (node_2, touching_2)

virtual_matchings: Vec<((DualNodePtr, DualNodeWeak), VertexIndex)>

those nodes matched to the boundary. ((node, touching), virtual_vertex)

Implementations

impl IntermediateMatching

pub fn new() -> Self

pub fn append(&mut self, other: &mut Self)

pub fn get_perfect_matching(&self) -> PerfectMatching

expand the intermediate matching into a perfect matching with only syndrome nodes

impl IntermediateMatching

pub fn expand_peer_matching( dual_node_ptr_1: &DualNodePtr, touching_ptr_1: &DualNodePtr, dual_node_ptr_2: &DualNodePtr, touching_ptr_2: &DualNodePtr, ) -> Vec<(DualNodePtr, DualNodePtr)>

break down a single matched pair to find the perfect matching

pub fn expand_blossom( blossom_ptr: &DualNodePtr, touching_ptr: &DualNodePtr, ) -> Vec<(DualNodePtr, DualNodePtr)>

expand blossom iteratively into matched pairs, note that this will NOT change the structure of the primal module;

Trait Implementations

impl Debug for IntermediateMatching

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

Formats the value using the given formatter.

impl Default for IntermediateMatching

fn default() -> Self

Returns the “default value” for a type.