#

Note

This documents the development version of NetworkX. Documentation for the current release can be found here.

#

networkx.algorithms.matching.is_perfect_matching

is_perfect_matching(G, matching)

Decides whether the given set represents a valid perfect matching in G.

A perfect matching in a graph is a matching in which exactly one edge is incident upon each vertex.

Parameters

• G (NetworkX graph)

• matching (dict or set) – A dictionary or set representing a matching. If a dictionary, it must have matching[u] == v and matching[v] == u for each edge (u, v) in the matching. If a set, it must have elements of the form (u, v), where (u, v) is an edge in the matching.

Returns

Whether the given set or dictionary represents a valid perfect matching in the graph.

Return type

bool