dcs(g_original: object) → cdlib.classes.node_clustering.NodeClustering

Divide and Conquer Strategy

Supported Graph Types

Undirected Directed Weighted
Yes No Yes
Parameters:g_original – a networkx/igraph object
Returns:NodeClustering object
>>> from cdlib import algorithms
>>> import networkx as nx
>>> G = nx.karate_club_graph()
>>> coms = algorithms.dcs(G)
References:Syed Agha Muhammad and Kristof Van Laerhoven. “DCS: Divide and Conquer Strategy For Detecting Overlapping Communities in Social Graphs”.