| Input: Set ED of affected or potentially affected edges traversed in the CIG graph |
| Set of test cases that covers the classes in ACD |
| Output: set of test cases selected from . |
| Description: this algorithm is responsible for finding the test cases from that traverse |
| those affected or potentially affected edges. Selection is based on the test cases selected from |
| the affected class diagram. |
|
| do |
| |
| For each |
| |
| If covers // if the test case traverses the modified edge |
| = |
| |
| |
| Return |