Algorithm 3 Add_nodes

Input: $AN,G,C$

Output: $\mathsf{\Delta }g$

1: for each node $v\in AN$ do

2:  if $N(v$) in the same community $C_{N\left(v\right)}$ then

3:   $C_{N\left(v\right)}\leftarrow v$

4:  else

5:   $\mathsf{\Delta }g\leftarrow v$

6:   for each node $u\in N\left(v\right)$ do

7:    $\mathsf{\Delta }g\leftarrow C_u$

8:   end for

9:  end if

10: end for