~i LSSKJr SSKrS/r\R SSj5rSrg)) defaultdictNk_clique_communitiesc## US:a[R"SUS35eUc[R"U5nUVs/sHn[U5U:dM[ U5PM! nn[ [ 5nUHnUHnXFRU5 M M! [R"5nURU5 UHIn[XT5H7n[URU55US- :dM&URXX5 M9 MK [R"U5Hn [R"U 6v M gs snf7f)uFind 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.N)nx NetworkXError find_cliqueslen frozensetrlistappendGraphadd_nodes_from_get_adjacent_cliques intersectionadd_edgeconnected_componentsunion) Gkcliquescmembership_dictcliquenode perc_graph adj_clique components b/home/mande/repo/quber/.venv/lib/python3.13/site-packages/networkx/algorithms/community/kclique.pyrrsN 1uA3&ABCC//!$%,##F7I,,Z8  *+9%=s>E EE&BE 8AE cr[5nUH&nXHnX:wdM URU5 M M( U$N)setadd)rradjacent_cliquesnrs r rrIs=u ),J# $$Z0- r") collectionsrnetworkxr__all__ _dispatchablerrr'r r-s3# ! "=,=,@r'