Decides whether the given set represents a valid perfect matching in
A perfect matching in a graph is a matching in which exactly one edge is incident upon each vertex.
G (NetworkX graph)
matching (dict or set) – A dictionary or set representing a matching. If a dictionary, it must have
matching[u] == vand
matching[v] == ufor 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.
Whether the given set or dictionary represents a valid perfect matching in the graph.
- Return type