Algorithm 2 CDID

Input: $G_t=(V_t,E_t)$

Output: $C_t$

1: $//$Initialization of information

2: for each node $v\in V_t$ do

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

4:   compute the $J{S}_{vu}$, $C{S}_{uv}$ using Equation (1)–(2)

5:  end for

6:  compute the $I_v$ using Equation (3)

7: end for

8: $//$Information dynamic interaction.

9: while $true$ do

10:  $I_{max}=0$

11:  for each node $v\in V_t$ do

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

13:    compute $I_{u\to v}$ using Equation (4)–(5)

14:    compute $I_{(u\to v)\_cost}$ using Equation (6)

15:    end for

16:   compute $I_{v(t+1)}$ using Equation (7)

17:   $I_{in}=I_{u\to v}-I_{(u\to v)\_cost}$

18:   if $I_{in}>I_{max}$ then

19:    $I_{max}=I_{in}$

20:    end if

21:  end for

22:  $//$ the balanced state

23:  if $I_{max}<Threshold$ then

24:   Break

25:  end if

26: end while

27: $//$ Find communities $C_t$

28: for each node $v\in V_t$ do

29:  if $v\notin C_t$ then

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

31:    if $|I_v-I_u|<Threshold$ then

32:     $u->C_v$

33:     else

34:     $u->C_u$

35:     end if

36:    end for

37:   end if

38: end for