+ jNRt^RIt^RIHt^RIHtR.t]!R4]!R4]PR444t R#)z Ramsey numbers. N)not_implemented_for)arbitrary_element ramsey_R2directed multigraphcaV'g\4\43#\V4oV3Rl\P!VS44p\P!VS4p\ VP V4P44wr4\ VP V4P44wrVVPS4VPS4\W5\R7\WF\R73#)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. c38<"TFqS8wgK VxK R#5i)N).0nbrnodes& i/home/luca/screen-checking/.venv/lib/python3.14/site-packages/networkx/algorithms/approximation/ramsey.py ramsey_R2..,s D4Ct CC4s )key) setrnx all_neighbors non_neighborsrsubgraphcopyaddmaxlen)Gnbrsnnbrsc_1i_1c_2i_2r s& @r rr s6 uce| Q D D2++At4 DD   Q %ED)..01HCE*//12HCGGDMGGDM sS !3sS#9 99) __doc__networkxrnetworkx.utilsrutilsr__all__ _dispatchablerr r!r r(sP.& -Z \"%:#!%:r!