 By removing these edges, the groups are separated from one another and so the underlying community structure of the network is revealed.The algorithm's steps for community detection are summarized below


The fact that the only betweennesses being recalculated are only the ones which are affected by the removal, may lessen the running time of the process' simulation in computers.However, the betweenness centrality must be recalculated with each step, or severe errors occur.