louvain

Definition

A greedy community-detection algorithm that maximizes modularity: move each node into whichever neighbouring community improves the score, collapse the resulting groups into single nodes, and repeat. The hierarchical structure makes it fast enough for very large graphs, which is why it became a default. Its known flaw is that a community it returns can be internally disconnected — the defect Leiden was designed to fix.