Expand description
Leiden community detection on the Property Graph.
Implements the Leiden algorithm (Traag, Waltman, van Eck 2019) for modularity-based graph clustering with guaranteed connected communities:
- Local moving: greedily move nodes to the community that yields the highest modularity gain.
- Refinement: within each community, find well-connected sub-communities to ensure connectivity.
- Aggregation: collapse sub-communities into super-nodes and repeat.