Skip to main content
. 2020 Jan 27;22(2):149. doi: 10.3390/e22020149
Algorithm 3 Function pb_ch_pref
Require:V˜in, Ri, Λi1(X)
  •  1:

    T˜iHX|VZ(n)Λi1(X)

  •  2:

    T˜iHX|V(n)HX|VZ(n)Ri

  •  3:

    for jHX|V(n)C do

  •  4:

        if jHX|V(n)CLX|V(n) then

  •  5:

            T˜i(j)pT(j)|T1:j1VnT˜i(j)|T˜i1:j1V˜in

  •  6:

        else if jLX|V(n) then

  •  7:

            T˜i(j)arg maxtXpT(j)|T1:j1Vnt|T˜i1:j1V˜in

  •  8:

        end if

  •  9:

    end for

  • 10:

    X˜inT˜inGn

  • 11:

    Λi(X)T˜iHX|V(n)HX|VZ(n)

  • 12:

    returnX˜in and Λi(X)