Struct petgraph::algo::matching::Matching

pub struct Matching<G: GraphBase> { /* private fields */ }

Computed matching of the graph.

Implementations

impl<G> Matching<G>

where G: NodeIndexable,

pub fn mate(&self, node: G::NodeId) -> Option<G::NodeId>

Gets the matched counterpart of given node, if there is any.

Returns None if the node is not matched or does not exist.

pub fn edges(&self) -> MatchedEdges<'_, G>

Iterates over all edges from the matching.

An edge is represented by its endpoints. The graph is considered undirected and every pair of matched nodes is reported only once.

pub fn nodes(&self) -> MatchedNodes<'_, G>

Iterates over all nodes from the matching.

pub fn contains_edge(&self, a: G::NodeId, b: G::NodeId) -> bool

Returns true if given edge is in the matching, or false otherwise.

If any of the nodes does not exist, false is returned.

pub fn contains_node(&self, node: G::NodeId) -> bool

Returns true if given node is in the matching, or false otherwise.

If the node does not exist, false is returned.

pub fn len(&self) -> usize

Gets the number of matched edges.

pub fn is_empty(&self) -> bool

Returns true if the number of matched edges is 0.

impl<G> Matching<G>

where G: NodeCount,

pub fn is_perfect(&self) -> bool

Returns true if the matching is perfect.

A matching is perfect if every node in the graph is incident to an edge from the matching.