List test paths that achieve node coverage but not edge coverage on the graph. public boolean isPerfect(int x) { int sum = 0; Boolean output; for(int i = 1; i<=(x/2); i ++) { if(x%i == 0) { sum = sum + i; } } if(sum == x) { output = true; }else { output = false; } return output; }
List test paths that achieve node coverage but not edge coverage on the graph.
public boolean isPerfect(int x) {
int sum = 0;
Boolean output;
for(int i = 1; i<=(x/2); i ++) {
if(x%i == 0) {
sum = sum + i;
}
}
if(sum == x) {
output = true;
}else {
output = false;
}
return output;
}
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
