\MhNdZddlZddlmZddlmZdgZededejd Z dS) z Ramsey numbers. N)not_implemented_for)arbitrary_element ramsey_R2directed multigraphcV|sttfSt|fdtj|D}tj|}t ||\}}t ||\}}||t||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|] }|k|V dS)N).0nbrnodes h/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/networkx/algorithms/approximation/ramsey.py zramsey_R2..,s' D DCt C D D)key) setrnx all_neighbors non_neighborsrsubgraphcopyaddmaxlen)Gnbrsnnbrsc_1i_1c_2i_2rs @rrr s6 uucee| Q  D D D D D2+At44 D D DD  Q % %ED))..0011HCE**//1122HCGGDMMMGGDMMM sCS ! ! !3sCS#9#9#9 99r) __doc__networkxrnetworkx.utilsrutilsr__all__ _dispatchablerr rrr)s......&&&&&& -Z  \""%:%:#"! %:%:%:r