Skip to main content

Module community

Module community 

Source

Structs§

Community
CommunityResult

Functions§

label_propagation
Label propagation community detection. Each node adopts the label most common among its neighbors.
louvain
Louvain method for community detection. Iteratively moves nodes to communities that maximize modularity gain.
modularity
Compute modularity Q for a given partitioning of the graph. Q = (1/2m) * sum_ij [ A_ij - k_i*k_j/(2m) ] * delta(c_i, c_j)