\Mh HddlmZddlZdgZejddZdZdS)) defaultdictNk_clique_communitiesc#NKdkrtjdd|tj|}fd|D}tt}|D]"}|D]}|||#tj}|||D]T}t||D]A}t| |dz kr| ||BUtj |D]}tj|VdS)u8Find k-clique communities in graph using the percolation method. A k-clique community is the union of all cliques of size k that can be reached through adjacent (sharing k-1 nodes) k-cliques. Parameters ---------- G : NetworkX graph k : int Size of smallest clique cliques: list or generator Precomputed cliques (use networkx.find_cliques(G)) Returns ------- Yields sets of nodes, one for each k-clique community. Examples -------- >>> G = nx.complete_graph(5) >>> K5 = nx.convert_node_labels_to_integers(G, first_label=2) >>> G.add_edges_from(K5.edges()) >>> c = list(nx.community.k_clique_communities(G, 4)) >>> sorted(list(c[0])) [0, 1, 2, 3, 4, 5, 6] >>> list(nx.community.k_clique_communities(G, 6)) [] References ---------- .. [1] Gergely Palla, Imre Derényi, Illés Farkas1, and Tamás Vicsek, Uncovering the overlapping community structure of complex networks in nature and society Nature 435, 814-818, 2005, doi:10.1038/nature03607 zk=z, k must be greater than 1.NcTg|]$}t|kt|%S)len frozenset).0cks e/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/networkx/algorithms/community/kclique.py z(k_clique_communities..3s*<<<A! y|| )nx NetworkXError find_cliquesrlistappendGraphadd_nodes_from_get_adjacent_cliquesr intersectionadd_edgeconnected_componentsr union) Gr cliquesmembership_dictcliquenode perc_graph adj_clique components ` rrrsqN 1uuBABBBCCC/!$$<<<>##FJ777 8 ,Z88,,  *++++,,rcxt}|D](}||D]}||kr||)|SN)setadd)r!r adjacent_cliquesnr$s rrrIs\uu 11)!, 1 1J## $$Z000 1 rr') collectionsrnetworkxr__all__ _dispatchablerrrrrr0si###### ! "=,=,=,=,@r