The invention relates to a
community discovery method based on a Louvain
algorithm,
computer equipment and a readable storage medium thereof. The method comprises the following steps: S1, generating agraph representing a
network structure according to input data, wherein the graph comprises nodes and edges; S2, taking each node of the graph as an independent
community; S3, performing inner-layercirculation and updating the affiliated
community of each node; S4, repeating the step S3 until the percentage of the
modularity change of the graph is less than a first threshold value and the
current cycle index is an even number, or the inner-layer cycle index is greater than a second threshold value and the
current cycle index is an even number, and ending the inner-layer cycle; S5, performing
connectivity check on each community; if the communities are not connected, segmenting the communities into a plurality of connected sub-graphs, and taking each connected sub-graph as an independentcommunity; S6, compressing all the communities, and compressing each community into a node; and S7, inputting the result of the step S6 into the step S2, repeating the steps S3 to S6, and outputtingthe result until the
modularity of the graph does not change any more or the percentage of the change is smaller than a third threshold.