Function retworkx::is_matching

pub fn is_matching(graph: &PyGraph, matching: HashSet<(usize, usize)>) -> bool

Check if matching is valid for graph

A matching in a graph is a set of edges in which no two distinct edges share a common endpoint.

:param PyDiGraph graph: The graph to check if the matching is valid for :param set matching: A set of node index tuples for each edge in the matching.

:returns: Whether the provided matching is a valid matching for the graph :rtype: bool