软件测试(四)——Graph覆盖
1、CFG控制流图
2、定义素数列表时,将MAXPRIMES设为3、4
3、设n=1即可
4、节点覆盖: TR = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}
test path = [1,2,3,4,5,6,7,5,6,8,9,10,11,12,13,14,12,15]
边覆盖: TR = {(1,2),(2,3),(2,11)(3,4),(4,5),(5,6),(5,9),(6,7),(7,5),(6,8),(8,9),(9,10),(9,2),(10,11),(10,2),(11,12),(12,13),(13,14),(14,12),(12,15)}
test paths = [1,2,3,4,5,6,7,5,6,8,9,2,11,12,13,14,12,15]
[1,2,3,4,5,9,10,2,11,12,13,14,12,15]
主路径覆盖:[1,2,3,4,5,6,7]
[1,2,3,4,5,6,8,9]
[1,2,3,4,5,9]
[1,2,3,4,5,6,8,9,10]
[1,2,3,4,5,9,10]
[1,2,11,12,15]
[1,2,11,12,13,14]
[3,4,5,6,8,9,2,11,12,13,14]
[3,4,5,6,8,9,10,2,11,12,13,14]
[3,4,5,6,8,9,2,11,12,15]
[3,4,5,6,8,9,10,2,11,12,15]
[3,4,5,9,10,2,11,12,13,14]
[3,4,5,9,2,11,12,13,14]
[3,4,5,9,10,2,11,12,15]
[3,4,5,9,2,11,12,15]
[6,7,5,9,10,2,11,12,13,14]
[6,7,5,9,2,11,12,13,14]
[6,7,5,9,10,2,11,12,15]
[6,7,5,9,2,11,12,15]
[13,14,12,15]
[12,13,14,12]
[5,6,7,5]
[2,3,4,5,6,8,9,10,2]
[2,3,4,5,9,2]
[2,3,4,5,9,10,2]
[2,3,4,5,6,8,9,2]
5、 Junit进行主路径覆盖测试