今天老师布置了一个作业,发现有点难度,特来随笔记录一下,附上题目
题目:
下面给出我自己的解,若有错误,希望能有高人指出
(A)
(b) S = []; N = 1;
(c) Node Coverage = {1,2,3,4,5,6,7,8,9,10,11};
Edge Coverage = {(1,2), (2,3),(3,4),(3,5),(3,6),(3,7),(5,8),(5,9),
(8,10),(9,10),(10,2),(2,11)};
Prime Path Coverage = {(1,2,3,4,10),(1,2,3,5,8,10),(1,2,3,5,9,10),(1,2,3,5,9,10),
(1,2,3,6,10),(1,2,3,7,10),}…….
(d) I cant find it;
用Junit 运行测试用例:,覆盖了主路径:(1,2,11):
结果令人满意