Graph

Louvain

Stats

Nodes0
Edges0
Modularity Q0.000
Communities0
Pass / level0 / 0
Statusready
The Louvain method greedily maximizes modularity Q = (1/2m)·Σ[Aij − γ·kikj/2m]·δ(ci,cj). Step runs one local-moving + aggregation pass. Raise γ to favor more, smaller communities; lower it to favor fewer, larger ones. Drag any node to rearrange the layout.