For example I got a code:
int a = 3;
if(a < 0)
{
System.out.println(“a < 0");
}
else if (a == 0)
{
System.out.println(“a == 0");
}
else
{
do{
System.out.println(“Loop never end");
}while(true)
}
return a;
Cyclomatic complexity I calculated is 4. But I can only find 3 independent path since there only one independent path throw do while, what's wrong?