Fig. 2From: Social network development in classroomsSimple network demonstrating how the edge-betweenness algorithm works. Edge widths in this network are proportional to their betweenness scores. The edge between node E and F is removed first, splitting the network into two groups. The vertex color shows the communities identified by the edge-betweenness algorithmBack to article page