Struct MatchingGraph 

pub struct MatchingGraph { /* private fields */ }

Implementations

impl MatchingGraph

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

pub fn from_graph<G: Graph>(graph: &G) -> Self

pub fn has_edge(&self, from: usize, to: usize) -> bool

pub fn add_edge(&mut self, from: usize, to: usize)

pub fn remove_edge(&mut self, from: usize, to: usize)

pub fn create_vertex_if_not_exists(&mut self, vertex: usize)

if given vertex is removed but has neighbors - will be recovered as is

pub fn add_vertex(&mut self, vertex: MatchingVertex)

pub fn size(&self) -> usize

pub fn max_vertex_index(&self) -> usize

pub fn vertices(&self) -> MatchingGraphVerticesIter<'_>

pub fn neighbors(&self, vertex: usize) -> &Vec<usize>

can crash if vertex >= self.vertices.len()

pub fn remove_vertex(&mut self, vertex: usize)

pub fn has_odd_size_component(&mut self) -> bool

pub fn perfect_matchings(&mut self) -> Vec<Matching>

Trait Implementations

impl Clone for MatchingGraph

fn clone(&self) -> MatchingGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MatchingGraph

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

Formats the value using the given formatter.