Matching¶
A matching is a subset of graph edges in which no vertex occurs more than once.

A matching for a Chimera unit cell: no vertex is incident to more than one edge in the set of blue edges¶
|
Returns an approximate minimum maximal matching. |
|
Determines whether the given set of edges is a matching. |
|
Determines whether the given set of edges is a maximal matching. |