Algorithm 3 CSFR-M

1:   $f$: the failed node; $M_f$: the node connectivity materiality; $P{C}_f$: the node partition character

2:   if $1<M_f\le \infty$ then

3:    if there are orphan nodes after the failure then

4:     the orphan which is nearest to node $f$ will be chosen and move to replace it

5:    else

6:     if $1<M_f<\infty$ then

7:      Algorithm 2 CC-link establishment

8:      if receiving the announcement then

9:       the neighbors $N_f$ with minimum number of neighbors will be chosen to replace $f$

10:      end if

11:     else

12:      if $P{C}_f>2$ Then

13:       the neighbors $N_f$ with minimum number of neighbors will be chosen to replace $f$

14:      else

15:       Algorithm 2 CC-link establishment

16:       if receiving the announcement then

17:        the neighbors $N_f$ with minimum number of neighbors will be chosen to replace $f$

18:       end if

19:      end if

20:     end if

21:    end if

22: end if