Research Article
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 | | If | | | IF then | ED = | Else | If is not marked as visited | Compare | End if | For each edge leaving and not found in do | | End For | End compare |
|