Introduction - If you have any usage issues, please Google them yourself
In order to reduce the time complexity of the algorithm, Vincent Blondel et al. Proposed another hierarchical greedy algorithm (BGLL algorithm). The algorithm consists of two phases, which are repeated iteratively until the network community is divided by no longer growing. The first phase merges the community, and the algorithm treats each node as a community, based on the modularity maximization criteria, which neighbor communities should be merged. After the second phase of the scan, the algorithm will re-see all the communities found in the first stage as nodes, build new networks, and carry out the first phase on the new network. When the degree of the module is no longer increased, the optimal neighborhood of the community is obtained.