Struct SubGraphBuilder 

pub struct SubGraphBuilder {
    pub vertex_num: VertexNum,
    pub complete_graph: CompleteGraph,
    pub subgraph: BTreeSet<EdgeIndex>,
    /* private fields */
}

build a subgraph based on minimum-weight paths between matched pairs

Fields

vertex_num: VertexNum

number of vertices

complete_graph: CompleteGraph

an instance of complete graph to compute minimum-weight path between any pair of vertices

subgraph: BTreeSet<EdgeIndex>

current subgraph, assuming edges are not very much

Implementations

impl SubGraphBuilder

pub fn new(initializer: &SolverInitializer) -> Self

pub fn clear(&mut self)

pub fn load_erasures(&mut self, erasures: &[EdgeIndex])

temporarily set some edges to 0 weight, and when it resets, those edges will be reverted back to the original weight

pub fn load_dynamic_weights(&mut self, dynamic_weights: &[(EdgeIndex, Weight)])

pub fn load_perfect_matching(&mut self, perfect_matching: &PerfectMatching)

load perfect matching to the subgraph builder

pub fn load_subgraph(&mut self, subgraph: &[EdgeIndex])

pub fn add_matching(&mut self, vertex_1: VertexIndex, vertex_2: VertexIndex)

add a matching, finding the minimum path and XOR them into the subgraph (if adding the same pair twice, they will cancel each other)

pub fn total_weight(&self) -> Weight

get the total weight of the subgraph

pub fn get_subgraph(&self) -> Vec<EdgeIndex>

get subgraph as a vec

Trait Implementations

impl Clone for SubGraphBuilder

fn clone(&self) -> SubGraphBuilder

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SubGraphBuilder

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

Formats the value using the given formatter.