ިsgN~dZddlZddlmZddlmZdgZededejd Z y) z Ramsey numbers. N)not_implemented_for)arbitrary_element ramsey_R2directed multigraphc|sttfSt|fdtj|D}tj|}t |j |j\}}t |j |j\}}|j|jt||tt||tfS)aHCompute 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. c3.K|] }|k7s |yw)N).0nbrnodes [/var/www/html/venv/lib/python3.12/site-packages/networkx/algorithms/approximation/ramsey.py zramsey_R2..,s DCt C Ds )key) setrnx all_neighbors non_neighborsrsubgraphcopyaddmaxlen)Gnbrsnnbrsc_1i_1c_2i_2rs @rrr s6 uce| Q D D2++At4 DD   Q %ED)..01HCE*//12HCGGDMGGDM sCS !3sCS#9 99) __doc__networkxrnetworkx.utilsrutilsr__all__ _dispatchablerr r"rr)sP.& -Z \"%:#!%:r"