+ jRt^RIHt^RIt^RIHt.ROt]!R4]!R4]PR444t Rt ]PR4t ]PR 4t ]PR 4t ]!R4]!R4]P!R R 7RR l444t]!R4]!R4]P!R R 7RRl444tR#)z;Functions for computing and verifying matchings in a graph.)repeatN)not_implemented_for multigraphdirectedc\4p\4pVP4FApVwrEWB9gKWR9gKWE8wgKVPV4VPV4KC V#)aIFind a maximal matching in the graph. A matching is a subset of edges in which no node occurs more than once. A maximal matching cannot add more edges and still be a matching. Parameters ---------- G : NetworkX graph Undirected graph Returns ------- matching : set A maximal matching of the graph. Examples -------- >>> G = nx.Graph([(1, 2), (1, 3), (2, 3), (2, 4), (3, 5), (4, 5)]) >>> sorted(nx.maximal_matching(G)) [(1, 2), (3, 5)] Notes ----- The algorithm greedily selects a maximal matching M of the graph G (i.e. no superset of M exists). It runs in $O(|E|)$ time. )setedgesaddupdateGmatchingnodesedgeuvs& ]/home/luca/screen-checking/.venv/lib/python3.14/site-packages/networkx/algorithms/matching.pymaximal_matchingrsW<uH EE  >an LL  LL   Oc\4pVP4FGpVwr4WC3V9gW!9dKW48Xd\P!RV 24hVP V4KI V#)aConverts matching dict format to matching set format Converts a dictionary representing a matching (as returned by :func:`max_weight_matching`) to a set representing a matching (as returned by :func:`maximal_matching`). In the definition of maximal matching adopted by NetworkX, self-loops are not allowed, so the provided dictionary is expected to never have any mapping from a key to itself. However, the dictionary is expected to have mirrored key/value pairs, for example, key ``u`` with value ``v`` and key ``v`` with value ``u``. z%Selfloops cannot appear in matchings )ritemsnx NetworkXErrorr )r rrrrs& rmatching_dict_to_setr<sc EE  6U?dm  6""%J4&#QR R $ ! Lrc\V\4'd \V4p\4pVFp\ V4^8wd\ P !RV 24hVwrEW@9gWP9d\ P !RV R24hWE8XdR#VPWE4'gR#WB9gWR9dR#VPV4K R#)a[Return True if ``matching`` is a valid matching of ``G`` 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. 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 matching in the graph. Raises ------ NetworkXError 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. Examples -------- >>> 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 True matching has non-2-tuple edge matching contains edge  with node not in GFT isinstancedictrrlenrrhas_edger r s&& r is_matchingr#UsR(D!!'1 EE t9>""%CD6#JK K :""%>> G = nx.Graph([(1, 2), (1, 3), (2, 3), (3, 4), (3, 5)]) >>> nx.is_maximal_matching(G, {(1, 2), (3, 4)}) True rrrFT) rr rrr!rrr"r r r)r r rrrrrs&& ris_maximal_matchingr%s>(D!!'1 EE EE t9>""%CD6#JK K :""%>> G = nx.Graph([(1, 2), (1, 3), (2, 3), (2, 4), (3, 5), (4, 5), (4, 6)]) >>> my_match = {1: 2, 3: 5, 4: 6} >>> nx.is_perfect_matching(G, my_match) True rrrFrr s&& ris_perfect_matchingr's@(D!!'1 EE t9>""%CD6#JK K :""%&min_weight_matching..7s2'wq!'sc3@<"TFwrq1VSV, 3xK R#5ir/r0)r1rrr3 max_weights& rr4r59s ;7aJN #7sr()r!rmax_weight_matchingmaxrGraphadd_weighted_edges_from)r r(G_edgesInvGrr7s&& @rmin_weight_matchingr?s` 177|q"1T&IIgg61g-GS2'222J 88:D ;7 ;E   6 tD HHrc aaaaaaaaaa a!a"a#a$a%a&a'a(a)a*!RR4o!V3RlR4o\S4o$S$'g \4#^pRpSPRR7F]wrVpVPS^4pWV8wd W8dTpT;'d.\ \ V44P R4^,R9pK_ /o(/o&/o'\\S$S$44o%\\S$\R444o"\\S$S$44o /o\\S$\V444o#/o!/o.o)VV#V3R lo*VVVV V%V&V'V(V)3 R loVV V%V&V'V(3R lp VVVV V!V"V%V&V'V(V)V*3 R lp VVVVV V!V"V%V&V'V(3 R lp VV V"V(3RloVVV V%V&V'V(3Rlp VV!V"V#V$V(VV3Rlp S&P4S'P4SP4S!F pRVn K SP4.S)R&S$F2pVS(9gK S&PS%V,4eK(S!V^R4K4 ^pS)'EdV'EgS)P4pS&S%V,,^8XgQhSPV4EFwpVV8XdK S%V,pS%V,pVV8XdK(VV3S9dS*!VV4pV^8:dR;SVV3&SVV3&VV3S9dS&PV4f S!V^V4KwS&PV4^8Xd+V !VV4pVSJd V !VVV4KV !VV4^pEKS&PV4fS&V,^8XgQh^S&V&VV3S'V&KKS&PV4^8Xd3SPV4eXS*!SV,!8d VV3SV&EK/EK2S&PV4eEKHSPV4eXS*!SV,!8gEKpVV3SV&EKz EKV'dEMFRpR;p;ppS'g^p\S#P44pSP!4F^pS&PS%V,4eKSPV4fK4S*!SV,!pVR8Xg VV8gKQTp^pSV,pK` S"FpS"V,eKS&PV4^8XgK(SPV4fK=S*!SV,!pV'dV^,^8XgQhV^,pM VR, pVR8Xg VV8gKTp^pSV,pK S!FLpS"V,eKS&PV4^8XgK(VR8XgS!V,V8gK?S!V,p^pTpKN VR8Xd0S'gQh^p\#^\S#P444pS$FkpS&PS%V,4^8XdS#V;;,V,uu&K7S&PS%V,4^8XgKVS#V;;,V, uu&Km S!FjpS"V,eKS&PV4^8XdS!V;;,V, uu&K=S&PV4^8XgKUS!V;;,V,uu&Kl V^8XdMV^8Xd?VwppS&S%V,,^8XgQhR;SVV3&SVV3&S)P%V4EKV^8Xd?VwppR;SVV3&SVV3&S&S%V,,^8XgQhS)P%V4EKV^8XgEKV !VR4EKS(FpS(S(V,,V8XdKQh V'gMj\S!P'44FJpVS!9dK S"V,eKS&PV4^8XgK1S!V,^8XgKAV !VR4KL EK=V'dV !4\)S(4#)aCompute a maximum-weighted matching of G. A matching is a subset of edges in which no node occurs more than once. The weight of a matching is the sum of the weights of its edges. A maximal matching cannot add more edges and still be a matching. The cardinality of a matching is the number of matched edges. Parameters ---------- G : NetworkX graph Undirected graph maxcardinality: bool, optional (default=False) If maxcardinality is True, compute the maximum-cardinality matching with maximum weight among all maximum-cardinality matchings. weight: string, optional (default='weight') Edge data key corresponding to the edge weight. If key not found, uses 1 as weight. Returns ------- matching : set A maximal matching of the graph. Examples -------- >>> G = nx.Graph() >>> edges = [(1, 2, 6), (1, 3, 2), (2, 3, 1), (2, 4, 7), (3, 5, 9), (4, 5, 3)] >>> G.add_weighted_edges_from(edges) >>> sorted(nx.max_weight_matching(G)) [(2, 4), (5, 3)] Notes ----- If G has edges with weight attributes the edge data are used as weight values else the weights are assumed to be 1. This function takes time O(number_of_nodes ** 3). If all edge weights are integers, the algorithm uses only integer computations. If floating point weights are used, the algorithm could return a slightly suboptimal matching due to numeric precision errors. This method is based on the "blossom" method for finding augmenting paths and the "primal-dual" method for finding a matching of maximum weight, both methods invented by Jack Edmonds [1]_. Bipartite graphs can also be matched using the functions present in :mod:`networkx.algorithms.bipartite.matching`. References ---------- .. [1] "Efficient Algorithms for Finding Maximum Matching in Graphs", Zvi Galil, ACM Computing Surveys, 1986. c]tRtRtRtRtR#)#max_weight_matching..NoNodeiz-Dummy value which is different from any node.r0N)__name__ __module__ __qualname____firstlineno____doc____static_attributes__r0rrNoNoderBs;rrIc:<a]tRtRtoRt.ROtV3RltRtVtR#)$max_weight_matching..Blossomiz7Representation of a non-trivial blossom or sub-blossom.c3<".VPOpV'dFVP4p\VS4'dVPVP4KGVxKMR#5ir/)childspoprextend)selfstacktBlossoms& rleaves+max_weight_matching..Blossom.leavessH"dkkNEIIKa))LL*G s A!AA!r0N)rMr mybestedges) rCrDrErFrG __slots__rTrH__classdictcell__) __classdict__rSs@rrSrKsE6   rrSTr,'Nc<SV,SV,,^SV,V,PS^4,, #))get)rr3r dualvarr(s&&rslack"max_weight_matching..slacks3qzGAJ&QqT!W[[-C)CCCrc< S V,pS PV4fS PV4eQhV;S V&S V&Ve W 3;S V&S V&M R;S V&S V&R;SV&SV&V^8XdG\VS4'd"S PVP44R#S P V4R#V^8XdSV,pS!S V,^V4R#R#r/)r^rrOrTappend)r3rRrbbaserS assignLabelbestedge blossombase inblossomlabel labeledgematequeues&&& rrf(max_weight_matching..assignLabels aLyy|# ! (<<<a58 =+,& 0IaL9Q<*. .IaL9Q<$(( hqk 6!W%% QXXZ( Q !Vq>D T At , rc<.pSpVSJdSV,pSV,^,'d SV,pMSV,^8XgQhVPV4^SV&S V,fSV,S 9gQhSpM^S V,^,S SV,,8XgQhS V,^,pSV,pSV,^8XgQhS V,^,pVSJgKYrKVFp^SV&K V#))rc) rr3pathrerdrIrhrirjrkrls && r scanBlossom(max_weight_matching..scanBlossomsvo! AQx!||"1~8q= = KKNE!H|#"1~T111 |A${1~*>>>>aLOaLQx1}$}aLO1AE!H rc&< SV,pSV,pSV,pS!4pVSV&RSV&VSV&.;VnpW3.;VnpWC8wdVSV&VPV4VPSV,4SV,^8Xg4SV,^8Xd$SV,^,SSV,,8XgQhSV,^,pSV,pKVPV4VP4VP4WS8wdVSV&VPV4VPSV,^,SV,^,34SV,^8Xg4SV,^8Xd$SV,^,SSV,,8XgQhSV,^,pSV,pKSV,^8XgQh^SV&SV,SV&^SV&VP 4F.pSSV,,^8XdSPV4VSV&K0 /p VEFp\ VS4'dfVP eVP p RVnMlVP 4UUu.uF&pSPV4Fq!V8wgK W3NK K( p ppM)SPV4Uu.uFq$V8wgK WB3NK p pV Fcp V wrSV ,V8XdYrSV ,pW8wgK(SPV4^8XgK@W9gS!W4S!W,!8gK_WV&Ke RSV&EK \V P44VnRpRSV&VP Fp S!V !pVe VX8gKT pTpK VSV&R#uuppiuupir/) rMrrcreverserTrrV neighborsr^listvalues)rerr3bbbvbwrdrqedgs bestedgetonblistkijbj mybestedgekslack mybestslackrSr rgrh blossomdual blossomparentrirjrkrlrmr`s&&& r addBlossom'max_weight_matching..addBlossom?s\ t_ q\ q\ I A a b4&!$h !M"  KKO KK " &9>b Q9R=#3tKO7L#L " a A1B B  h !M"  KKO KK2q)9R=+;< =9>b Q9R=#3tKO7L#L " a A1BRyA~~a } !  AAYq\"a' QIaL  B"g&&>>-^^F%)BN )+ (31Q[[^TUv^ F,-;;r?F?aAg'2'?FQ<1$qq\G " *.5; AW3W%&rN HRL78Z..01   AAYF!Vk%9 $  ! 7Gs&N N)N6Nc < VVVV V V V V VVV3 RlpV!W4.pV'd=VR,pVFpVPV!WQ44K0 VP4KDR#)c3V< "VPFYpRSV&\VS 4'd;V'dSV,^8XdVxK6VP4FpVSV&K KTVSV&K[ V'EgsSPV4^8XEd\SSV,^,,pVPP V4pV^,'d V\ VP4,p^pMRpSV,wr7V^8wdV^8XdVP V,wrMVP V^, ,wrRSV&RSV &S!V^V4R;S W3&S W3&WV, pV^8XdVP V,wr7MVP V^, ,wrsR;S W73&S Ws3&WV, pKVPV,p ^;SV&SV &W73;SV&SV &RSV &WV, pVPV,V8wdVPV,p SPV 4^8Xd WV, pKK\V S 4'd2V P4FpSPV4'gKM MT pSPV4'dQSV,^8XgQhSV,V 8XgQhRSV&RSSSV ,,&S!V^SV,^,4WV, pEKSPVR4SPVR4SPVR4SVSVSVR#5i)NT)rMrrTr^indexr!rrN)rdendstagesr entrychildrjstepr3pqr{rzrS allowedgerfrgrhrrrirjrkrls&& r_recurse.expandBlossom.._recursesXX#' a a))KNa$7!"A+,IaL",$%IaLH%))A,!"3 'y|A7 HHNN:.q55QXX&AEE |1fz wwqz1 wwq1u~#E!H#E!H1a(<@@Iqf% 1&(9JAz wwqz1 wwq1u~<@@Iqf% 1&(9JAXXa['((a5901v5 ! y}#  hhqkZ/!Byy})  !"g..!#A$yy|| %"-yy||$Qx1},}(|r111#'a7;d;r?34#Aq)A,q/:JA IIa  MM!T " LLD !a AAs&.L)AL)6AL)FL)/L) BL)NrrcrN)rdrrrQtoprrSrrfrgrhrrrirjrkrls&& r expandBlossom*max_weight_matching..expandBlossomsY [ [ D!&')C Xa23 rc<VVVV 3RlpV!W4.pV'd;VR,pVFpVPV!V!4K. VP4KBR#)c3f<"TpS V,V8wd S V,pK\VS4'dW!3xVPPV4;r4V^,'d V\VP4,p^pMRpV^8wdWE, pVPV,pV^8XdVPV,wrgMVPV^, ,wrv\VS4'dW&3xWE, pVPV,p\VS4'dW'3xVS V&VS V&KVPVRVPRV,VnVPVRVPRV,VnS VP^,,S V&S V,V8XgQhR#5i)Nr)rrMrr!r) rdrrRrrrr3xrSrhrrls && rr=max_weight_matching..augmentBlossom.._recursespA"a'!!$!W%%f HHNN1% %A1uuS]"q& HHQKA:771:DAq771q5>DAa))&L HHQKa))&LQQxx|ahhrl2AHggabkAGGBQK/AG(!5KNq>Q& &&sF.F1Nrr) rdrrrQrargsrSrhrrls && raugmentBlossom+max_weight_matching..augmentBlossomsU ) ') '`! )C Xt_- rc<W3W33Fwr#S V,pS V,^8XgQhS V,fS V,S 9g&S V,^,S S V,,8XgQh\VS4'd S!WB4VS V&S V,fKS V,^,pS V,pS V,^8XgQhS V,wr#S V,V8XgQh\VS4'd S!Wc4VS V&K R#)rN)r)rr3rrbsrRbtrSrrhrirjrkrls&& raugmentMatching,max_weight_matching..augmentMatchingSsVaV$DAq\RyA~%~!" -+b/2MbM!$[_(==b'**"2)QR=(bM!$q\RyA~%~ }"2!+++b'**"2)Q;%rcH<S'd&\^\SP44)4pM^p\SP44V,^8gQh\S 4^8Xg!\S P44^8gQhS P RR7EFdwrpVP S^4pW8XdK!SV,SV,,^V,, pV.pV.pSVR,,e"VP SVR,,4K3SVR,,e"VP SVR,,4K3VP4VP4\Wg4F$wrW8wdMV^S V,,, pK& V^8gQhSP V4V8XgSP V4V8XgEK=SV,V8XdSV,V8XgQhV^8XdEKeQh SF#p V S9dK SV ,V,^8XdK#Qh S Fpp S V ,^8gK\V P4^,^8XgQhV PR,F#wrSV,V8XdSV,V8XdK#Qh Kr R#)TrZN:rNr]r) r:minrxr!rr^rcruzip) vdualoffsetrrdwtr iblossoms jblossomsbirrrdr rrr_gnodesrlr+r(s r verifyOptimum*max_weight_matching..verifyOptimumts: a#gnn&6"7!78KK7>>#${2a777;1$K,>,>,@(AQ(FFFwwDw)GA!vq!Bv WQZ'!b&0AII " .:  y}!=> " .:  y}!=>        i38QR((46M6xx{a488A;!#3Aw!|Q1 44Av v)*,AI'!*{":a"? ??A1~!177|a'1,,,GGDMMDA7ashX<<8!WF u IJ777%a UU61  6bnITTSb]%8%8%=a%@O%S & D EIS()I VVD\23Ms66*+KH3vvi012G K I ED --2  J\!\!\!~ooh==BB)9)9Z   A AM aA 599Yq\#:#BAq$'  % IIKYq\*a///QAAv "1B"1BRx 1vY.!&q!!Q;DHHIq!f- 1a&0A1v* 99R=0(1a0"YYr]a/$/q!#4D#61!+4A 6!01 5,- %"YYq\1 $)9>1>'(E!H,-q6IaL22!+$<<+3vxPR|@T7T,-q6HRL8U1-$<<?2fuhqk?R6R+,a&HQKi(l I/3 3E 3I " GNN,-WWY99Yq\*2x||A7Rx{+A B!e) !$% $,QK #!!$, ! ) Q3"HQK0F! & q000"aK"SL B!e) !$% $,QK #$!!!$, ! )"bKNU,B'NE !I#$L!B&%~ As7>>#34599Yq\*a/AJ%'JYYy|,1AJ%'J ! #+yy|q(#A%/1*#A%/!A~a"AYq\*a///8<< 1a&!Iq!f$5 Qa"A8<< 1a&!Iq!f$5Yq\*a/// QalE2 AQ=A% %% k&&()A #Q'EIIaLA,=+a.TUBUa& *  %%r)r#r%r'r9r?rr8)Fr()rG itertoolsrnetworkxrnetworkx.utilsr__all__ _dispatchablerrr#r%r'r?r9r0rrrsA. \"Z $!#$N299x::z0 0 f\"Z X&4I'!#4In\"Z X&{ &'!#{ &r