Regression Test Selection for C# Programs

Algorithm 3

Algorithm to find affected or potentially affected edges in the CIG graph

Algorithm: Compare

Input: 𝑁: the entry node of the CIG of the original program 𝑃

  𝑁^′: the entry node of the CIG of the modified program 𝑃

Output: ED, which is the set of affected or potentially affected edges

Begin

 Mark 𝑁 as visited

 For each edge 𝑒^′ leaving 𝑁^′ do

  𝑒=match(𝑁,𝑒^′)

  If 𝑒=nullthencontinue

  𝐶=get-target(𝑒)

  𝐶^′=get-target(𝑒^′)

  IF 𝐶<>𝐶^′ then

   ED = ED∪𝑒

  Else

   If 𝐶 is not marked as visited

    Compare (𝐶,𝐶^′)

   End if

 For each edge leaving 𝑁 and not found in 𝑁^′ do

  ED=ED∪𝑒

 End For

End compare