Louvain community detection

[ArpitaHanjagi]

Algorithm: Louvain Method for Community Detection

Purpose: Detects communities or clusters in an undirected graph by optimizing modularity.

Theory:

Each node starts in its own community.

Iteratively moves nodes to neighboring communities to maximize modularity gain.

Aggregates nodes into super-nodes and repeats until modularity converges.

Time Complexity: Roughly O(V log V) for sparse graphs.

Space Complexity: O(V + E).

Input: Undirected graph as an adjacency list.

Output: Community assignment for each vertex.

[github-actions[bot]]

This PR is stale because it has been open 30 days with no activity. Remove stale label or comment or this will be closed in 7 days.

[github-actions[bot]]

This PR was closed because it has been stalled for 7 days with no activity.