cdlib.algorithms.umstmo¶

cdlib.algorithms.umstmo(g_original: object, weight: str = 'weight') → NodeClustering¶

Overlapping community detection based on the union of all maximum spanning trees

Supported Graph Types

Undirected	Directed	Weighted
Yes	No	Yes

Parameters:

g_original – a networkx/igraph object
weight – name of the edge attribute containing the weights, default “weight”

Returns:

NodeClustering object

Example:

>>> from cdlib import algorithms
>>> import networkx as nx
>>> G = nx.karate_club_graph()
>>> coms = algorithms.umstmo(G)

References:: Asmi, Khawla, Dounia Lotfi, and Mohamed El Marraki. “Overlapping community detection based on the union of all maximum spanning trees.” Library Hi Tech (2020).

Note