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

Algorithm 2

The AD algorithm.

(1) Input: Graph , node set , link set .

(2) Output: Community set .

(3) Process:

(4) Get weak link set   from .

(5) while    do

(6) , , .

(7) Get weak link set   from .

(8) end while

(9) Each component is considered as a community.

(10) return community set .