Ë ·¯wg—ãó:—dZddlZdgZejd„«Zy)a ************** Graph Matching ************** Given a graph G = (V,E), a matching M in G is a set of pairwise non-adjacent edges; that is, no two edges share a common vertex. `Wikipedia: Matching `_ éNÚmin_maximal_matchingcó,—tj|«S)aöReturns the minimum maximal matching of G. That is, out of all maximal matchings of the graph G, the smallest is returned. Parameters ---------- G : NetworkX graph Undirected graph Returns ------- min_maximal_matching : set Returns a set of edges such that no two edges share a common endpoint and every edge not in the set shares some common endpoint in the set. Cardinality will be 2*OPT in the worst case. Notes ----- The algorithm computes an approximate solution for the minimum maximal cardinality matching problem. The solution is no more than 2 * OPT in size. Runtime is $O(|E|)$. References ---------- .. [1] Vazirani, Vijay Approximation Algorithms (2001) )ÚnxÚmaximal_matching)ÚGs úo/home/mcse/projects/flask/flask-venv/lib/python3.12/site-packages/networkx/algorithms/approximation/matching.pyrrs€ô6 × Ñ ˜qÓ !Ð!ó)Ú__doc__ÚnetworkxrÚ__all__Ú _dispatchabler©r rúrs1ðñ óà !Ð "€ð×Ññ"óñ"r