Skip to main content
. 2024 Feb 20;24(5):1351. doi: 10.3390/s24051351
Algorithm 1: Context Slicing

  • Input: Edge Tree ET = {e1,e2,…,en}. Choose any edge ek in the edge tree that starts from the slicing point.

  • output: context-SDG

  1.    result = {ek}

  2.    queue = {ek}

  3.    while queue ! = ∅ do

  4.       for ei in queue do

  5.          for ej in get_direct_or_indirect_neighbors(ek) do

  6.             if ej not in result do

  7.                result.add(ej)

  8.             end if

  9.          end for

  10.       end for

  11.    end for

  12.  

  13.    context_SDG = {}

  14.    for ei in result do

  15.       for node in get_ successors_and_ predecessors(ei) do

  16.          if node not in context_SDG do

  17.             context_SDG.add(node)

  18.          end if

  19.       end for

  20.    end for

  21.  

  22.    return context_SDG