a:程序流图为:
b:当MAXPRIMES为4时,n==5会出现错误
c:测试用例为n=2的时候,恰好满足条件
d:
节点覆盖:
TR:
[0]
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]!
边覆盖:
TR:
[1,2]
[2,3]
[2,10]
[3,4]
[4,5]
[4,7]
[5,6]
[5,9]
[6,7]
[7,8]
[7,2]
[8,2]
[9,4]
主路径覆盖:41条
先求得简单路径如下图:
则主路径为:
TR:
[1,2,3,4,5,6,7,8]
[2,3,4,5,6,7,8,2]
[3,4,5,6,7,8,2,3]
[3,4,5,6,7,8,2,10]
[4,5,6,7,8,2,3,4]
[5,6,7,8,2,3,4,5]
[6,7,8,2,3,4,5,6]
[6,7,8,2,3,4,5,9]
[7,8,2,3,4,5,6,7]
[8,2,3,4,5,6,7,8]
[2,3,4,5,6,7,2]
[3,4,5,6,7,2,10]
[4,5,6,7,2,3,4]
[5,6,7,2,3,4,5]
[5,9,4,7,8,2,10]
[6,7,2,3,4,5,6]
[6,7,2,3,4,5,9]
[7,2,3,4,5,6,7]
[1,2,3,4,5,9]
[1,2,3,4,7,8]
[2,3,4,7,8,2]
[3,4,7,8,2,3]
[3,4,7,8,2,10]
[4,7,8,2,3,4]
[5,9,4,7,2,3]
[5,9,4,7,2,10]
[7,8,2,3,4,7]
[8,2,3,4,7,8]
[9,4,5,6,7,8]
[9,4,5,6,7,2]
[9,4,7,8,2,3]
[9,4,7,8,2,10]
[2,3,4,7,2]
[3,4,7,2,3]
[3,4,7,2,10]
[4,7,2,3,4]
[7,2,3,4,7]
[4,5,9,4]
[5,9,4,5]
[9,4,5,9]
[1,2,10]