Skip to main content
. 2020 Jul 27;20(15):4171. doi: 10.3390/s20154171
Algorithm 4 CA (cs, A)

  1.  {

  2.   P: = {cs}, N: = Ø, C:= {cs};

  3.   while (P≠Ø)

  4.   {

  5.    for each cp∈ P do

  6.    {

  7.     NB:= NB(cp);

  8.     for each cNB∈ NB do

  9.     {

  10.      if (CAO(A, cNB) == 1 && cNB ∉ C ) then

  11.      {

  12.       N:= N∪{cNB}, C:= C∪{cNB};

  13.      }

  14.    }

  15.    P: = N, N: = Ø;

  16.   }

  17.   return C;

  18.  }