Struct BipartiteMatching 

pub struct BipartiteMatching {
    pub size: usize,
    pub weight: f64,
    pub matching: Vec<VertexId>,
}

A maximum matching of a bipartite graph, the output of Graph::maximum_bipartite_matching.

Fields

size: usize

The number of matched pairs (the cardinality of the matching).

weight: f64

The total weight of the matched edges; equal to size for unweighted graphs.

matching: Vec<VertexId>

For each vertex, the vertex it is matched to, or UNMATCHED.

Implementations

impl BipartiteMatching

pub fn mate(&self, v: VertexId) -> Option<VertexId>

The vertex matched to v, or None if v is unmatched or out of range.

pub fn pairs(&self) -> Vec<(VertexId, VertexId)>

The matched pairs (u, v) with u < v, sorted by u.

pub fn is_matched(&self, v: VertexId) -> bool

Whether vertex v is matched.

Trait Implementations

impl Clone for BipartiteMatching

fn clone(&self) -> BipartiteMatching

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BipartiteMatching

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

Formats the value using the given formatter.

impl PartialEq for BipartiteMatching

fn eq(&self, other: &BipartiteMatching) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for BipartiteMatching