Algorithm 1 DCDID

Input: $DG=\{G_0,G_1,\dots ,G_k\}$

Output: $DC=\{C_0,C_1,\dots ,C_k\}$

1: $//$Initial community detection

2: $C_0=CDID\left(G_0\right)$

3: $//$Incremental community detection

4: for $t=1$ to k do

5:  compute AN,DN,AE,DE using Equation (8)–(11)

6:  $\mathsf{\Delta }{G}_t\leftarrow Add\_nodes(AN,G_t,C_{t-1})$

7:  $\mathsf{\Delta }{G}_t\leftarrow Del\_nodes(DN,G_{t-1},C_{t-1})$

8:  $\mathsf{\Delta }{G}_t\leftarrow Add\_edges(AE,C_{t-1})$

9:  $\mathsf{\Delta }{G}_t\leftarrow Del\_edges(DE,C_{t-1})$

10:  compute the unchanged communities $C_{t-1}^{{}^{\prime }}$

11:  $\mathsf{\Delta }{C}_t\leftarrow CDID\left(\mathsf{\Delta }{G}_t\right)$

12:  compute $C_t$ using Equation (12)

13:  end for