An Autonomous Divisive Algorithm for Community Detection Based on Weak Link and Link-Break Strategy

Figure 2

Calculation of end-frequency, arrival-frequency, and the shortest path coverage; the number inside the node is the node’s ID. (a) The calculation of end-frequency; the number beside the node is the node’s end-frequency; (b) the calculation of arrival-frequency; the number beside the node is the node’s arrival-frequency; (c) the calculation of the shortest path coverage; the number beside the node is the node’s shortest path coverage.

(a)

(b)

(c)