dwave_networkx.algorithms.matching.is_maximal_matching

is_maximal_matching(G, matching)

Determines whether the given set of edges is a maximal matching.

A matching is a subset of edges in which no node occurs more than once. The cardinality of a matching is the number of matched edges. A maximal matching is one where one cannot add any more edges without violating the matching rule.

Parameters:

• G (NetworkX graph) –
• edges (iterable) – A iterable of edges.

Returns:

is_matching – True if the given edges are a maximal matching.

Return type:

bool