Network Modules, Enrichment and Visualization
Community Detection Algorithms
| Algorithm | Complexity | Notes |
|---|---|---|
| Louvain | O(n log n) | Greedy modularity; can produce disconnected communities (bug) |
| Leiden | O(n log n) | Fixes Louvain bug; preferred for publication |
| Girvan-Newman | O(m²n) | Edge betweenness removal; slow, interpretable |
| Spectral clustering | O(n³) | Principled, no resolution limit |
| Infomap | O(m) | Best for directed networks |
[Description truncada. Veja o README completo no GitHub.]