A Critical Candidate Node-Based Attack Model of Network Controllability

. 2024 Jul 8;26(7):580. doi: 10.3390/e26070580

Algorithm 1 Critical Candidate Node-based Attack

Input: a network $G_{0}$ with N nodes.

Output: index t of the node to be attacked.

1: $t a b o o_l i s t \leftarrow A r r a y (0)$

2: $F C D \leftarrow A r r a y (N)$

3: $S C D \leftarrow A r r a y (N)$

4: $o u t_d e g r e e s \leftarrow A r r a y (N)$

5: for $i = 1$ to N do

6: if $g e t_i n d e g r e e (V_{i}) = = 0$ then

7: $t a b o o_l i s t . i n s e r t (i)$

8: end if

9: end for

10: for $j = 1$ to N do

11: if j in $t a b o o_l i s t$ then

12: $F C D [j] \leftarrow 0$

13: $S C D [j] \leftarrow 0$

14: else

15: $F C D [j] \leftarrow c a l c u l a t e_F C D (V_{j})$

16: $S C D [j] \leftarrow c a l c u l a t e_S C D (V_{j})$

17: end if

18: $o u t_d e g r e e s [j] \leftarrow g e t_o u t d e g r e e (V_{j})$

19: end for

20: if $m a x (F C D)! = 0$ then

21: $t \leftarrow a r g m a x (F C D)$

22: else if $m a x (S C D)! = 0$ then

23: $t \leftarrow a r g m a x (S C D)$

24: else

25: $t \leftarrow a r g m a x (o u t_d e g r e e s)$

26: end if

27: return t