Skip to main content
. 2023 Feb 11;25(2):334. doi: 10.3390/e25020334
Algorithm A1 An algorithm for carving a universe U into a set of non-overlapping complexes {S(i)*}
  • U=P(U)

  • i=1

  • while Udo

  •     S={S*U:φ(S*)=maxSUφ(S)}

  •     if |S|=1 then

  •         S(i)*=argmaxSUφ(S)

  •         U=U{SU:SS(i)*}

  •         i=i+1

  •     else

  •         T={SS:SSwithSSandSS}

  •         U=UT

  •         S=ST

  •         if |S|>0 then

  •            for SS do

  •                S(i)*=S

  •                U=U{SU:SS(i)*}

  •                i=i+1

  •            end for

  •         end if

  •     end if

  • end while