 By recalculating betweennesses after the removal of each edge, it is ensured that at least one of the remaining edges between two communities will always have a high value.The end result of the Girvan–Newman algorithm is a dendrogram.As the Girvan–Newman algorithm runs, the dendrogram is produced from the top down (i.e.