cdlib.algorithms.kclique¶
-
kclique
(g_original: object, k: int) → cdlib.classes.node_clustering.NodeClustering¶ Find 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_original – a networkx/igraph object
- k – Size of smallest clique
Returns: NodeClustering object
Example: >>> from cdlib import algorithms >>> import networkx as nx >>> G = nx.karate_club_graph() >>> com = algorithms.kclique(G, k=3)
References: 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