Struct WeightedGeneralMatching 

pub struct WeightedGeneralMatching { /* private fields */ }

Maximum-weight matching solver for a general undirected weighted graph.

Implementations

impl WeightedGeneralMatching

pub fn new(n: usize) -> Self

Create an edgeless instance on n vertices.

pub fn add_edge(&mut self, u: usize, v: usize, w: f64) -> GraphalgResult<()>

Add an undirected weighted edge (u, v, w).

Self-loops are ignored. Parallel edges are de-duplicated keeping the largest weight (only positive-contribution edges ever enter a maximum weight matching).

pub fn from_weighted_graph(g: &WeightedGraph) -> GraphalgResult<Self>

Build a solver from a WeightedGraph (treated as undirected; the larger weight is kept for each pair).

pub fn num_nodes(&self) -> usize

Number of vertices.

pub fn edges(&self) -> Vec<(usize, usize, f64)>

The de-duplicated edge list as (u, v, w) with u < v, sorted.

pub fn solve(&self) -> GraphalgResult<WeightedMatchingResult>

Solve for a maximum-weight matching (not necessarily of maximum cardinality).

pub fn solve_max_cardinality(&self) -> GraphalgResult<WeightedMatchingResult>

Solve for a maximum-weight matching among the maximum-cardinality matchings.

Trait Implementations

impl Clone for WeightedGeneralMatching

fn clone(&self) -> WeightedGeneralMatching

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for WeightedGeneralMatching

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

Formats the value using the given formatter.