hN~SrSSKrSSKJr SSKJr S/r\"S5\"S5\RS 555r g) z Ramsey numbers. N)not_implemented_for)arbitrary_element ramsey_R2directed multigraphc^U(d[5[54$[U5mU4Sj[R"UT55n[R"UT5n[ UR U5R55up4[ UR U5R55upVURT5 URT5 [X5[S9[XF[S94$)aCompute the largest clique and largest independent set in `G`. This can be used to estimate bounds for the 2-color Ramsey number `R(2;s,t)` for `G`. This is a recursive implementation which could run into trouble for large recursions. Note that self-loop edges are ignored. Parameters ---------- G : NetworkX graph Undirected graph Returns ------- max_pair : (set, set) tuple Maximum clique, Maximum independent set. Raises ------ NetworkXNotImplemented If the graph is directed or is a multigraph. c36># UHoT:wdM Uv M g7f)N).0nbrnodes Z/var/www/html/env/lib/python3.13/site-packages/networkx/algorithms/approximation/ramsey.py ramsey_R2..,s D4Ct CC4s  )key) setrnx all_neighbors non_neighborsrsubgraphcopyaddmaxlen)Gnbrsnnbrsc_1i_1c_2i_2rs @rrr s6 uce| Q D D2++At4 DD   Q %ED)..01HCE*//12HCGGDMGGDM sS !3sS#9 99) __doc__networkxrnetworkx.utilsrutilsr__all__ _dispatchablerr r#rr*sP.& -Z \"%:#!%:r#