Matching

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

image

A matching for a Chimera unit cell: no vertex is incident to more than one edge in the set of blue edges

min_maximal_matching(G[, sampler])

Returns an approximate minimum maximal matching.

is_matching(edges)

Determines whether the given set of edges is a matching.

is_maximal_matching(G, matching)

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