networkx 2.8.2 Pypi GitHub Homepage
Other Docs
ParametersReturnsBackRef
is_maximal_matching(G, matching)

A maximal matching in a graph is a matching in which adding any edge would cause the set to no longer be a valid matching.

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

bool

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

Return True if matching is a maximal matching of G

Examples

>>> G = nx.Graph([(1, 2), (1, 3), (2, 3), (3, 4), (3, 5)])
... nx.is_maximal_matching(G, {(1, 2), (3, 4)}) True
See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

networkx.algorithms.matching.is_matching networkx.algorithms.matching.is_maximal_matching

Local connectivity graph

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


GitHub : /networkx/algorithms/matching.py#144
type: <class 'function'>
Commit: