Note

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

Matching

Functions for computing and verifying matchings in a graph.

is_matching(G, matching)

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

is_maximal_matching(G, matching)

Decides whether the given set or dictionary represents a valid maximal matching in G.

is_perfect_matching(G, matching)

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

maximal_matching(G)

Find a maximal matching in the graph.

max_weight_matching(G[, maxcardinality, weight])

Compute a maximum-weighted matching of G.