is_matching(G, matching)
A matching in a graph is a set of edges in which no two distinct edges share a common endpoint. Each node is incident to at most one edge in the matching. The edges are said to be independent.
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.
If the proposed matching has an edge to a node not in G. Or if the matching is not a collection of 2-tuple edges.
Whether the given set or dictionary represents a valid matching in the graph.
Return True if matching
is a valid matching of G
>>> G = nx.Graph([(1, 2), (1, 3), (2, 3), (2, 4), (3, 5), (4, 5)])
... nx.is_maximal_matching(G, {1: 3, 2: 4}) # using dict to represent matching True
>>> nx.is_matching(G, {(1, 3), (2, 4)}) # using set to represent matching TrueSee :
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.matching.is_matching
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them