Algorithm 3MultiPath($B_r$,P,K,i,j,$type$)

1:for ($p=P$ to 2; $p--$) do 2:   Acquire the set ${\mathcal{G}}_{p,K}^{\langle i,j\rangle }$; 3:   if ($type$ = PS) then 4:     $B_p⟵\left((1-\beta )B_r\right)/(p-1)$; 5:   else if ($type=$ US) then 6:     $B_p⟵B_r/p$; 7:   end if 8:   for ($k=1$ to K; $k++$) do 9:     if ($SA$($B_p$,$g_{p,k}^{\langle i,j\rangle }$) = $true$) then 10:        if ($type$ = PS) then 11:          Solve T-SA; 12:        end if 13:        return $Accepted$; 14:     end if 15:   end for 16: end for 17:return $Blocked$;