hw3

2.

将第20行 for(int i = 0; i<=numPrimes-1;i++)改为for(int i = 0; i<numPrimes-1;i++)

3.

n=2

4.

节点覆盖：

[0,1,2,3,5,3,4,6,7,8,9,10,11]

边覆盖

[0,1,2,3,5,3,4,6,7,8,9,10,9,10,11]

[0,1,2,3,4,7,1,2,3,4,7,8,9,10,11]

主路径覆盖：

[0,1,2,3,5,3,5,3,4,6,7,1,2,3,4,7,1,2,3,4,6,7,1,2,3,4,6,7,8,9,10,9,10,11]

[0,1,2,3,4,6,7,8,9,10,11]

[0,1,2,3,4,7,8,9,10,11]

 

转载于:https://www.cnblogs.com/landi/p/6550790.html