The graph defined by the following sets:
- N = {1, 2, 3, 4, 5, 6, 7}
- N0 = {1}
- Nf = {7}
- E = {(1, 2), (1, 7), (2, 3), (2, 4), (3, 2), (4, 5), (4, 6), (5, 6), (6, 1)}
Also consider the following (candidate) test paths:
- p1 = [1, 2, 4, 5, 6, 1, 7]
- p2 = [1, 2, 3, 2, 4, 6, 1, 7]
- p3 = [1, 2, 3, 2, 4, 5, 6, 1, 7]
13 requirements are needed for Edge-Pairs:
- [1,2,3]
- [1,2,4]
- [1,7]
- [2,3,2]
- [2,4,5]
- [2,4,6]
- [3,2,3]
- [3,2,4]
- [4,5,6]
- [4,6,1]
- [5,6,1]
- [6,1,2]
- [6,1,7]