grinpy.invariants.matching.min_maximal_matching¶

grinpy.invariants.matching.min_maximal_matching(G)¶

Return a smallest maximal matching in G.

A maximal matching is a maximal set of edges such that no two edges in the set have a common endpoint.

Parameters:	G (NetworkX graph) – An undirected graph.
Returns:	A list of edges in a smalles maximal matching.
Return type:	list