I am trying to find community in a simple undirected network. I am looking for algorithm as well as code with lower time complexity than Clauset-Newman-Moore(CNM) algorithm. I tried to search but I couldn't find, please guide me here.
Try the Leiden algorithm, it's a faster implementation of the Louvain algorithm with a smaller chance of returning poorly connected/disconnected communities.