Girvan–Newman algorithm: Difference between revisions

Content deleted Content added
No edit summary
In second step of the algorithm only one edge is removed
Line 12:
 
# The betweenness of all existing edges in the network is calculated first.
# The edgesedge with the highest betweenness areis removed.
# The betweenness of all edges affected by the removal is recalculated.
# Steps 2 and 3 are repeated until no edges remain.