Cyclomatic complexity and exception handling

[=?ISO-8859-1?Q?Mika_M=E4ntyl=E4?=]

Hi,

Does anyone have ideas how to count cyclomatic complexity when
exceptions are involved? For example consider the following pseudo Java code

try {
class.mayThrowException(0);
class.mayThrowException(1);
class.mayThrowException(2);
}
catch (Exception E){
exception.handling();
}


In the code above, is the cyclomatic complexity 1, 2 or 3? Without
exception handling the answer would naturally be 1. With exceptions
involved I would say that the answer is 3. However, this means that
cyclomatic complexity increases every time there is call to a method
that can throw exceptions e.g. class.mayThrowException


Any opinions or information on the issue is appreciated.


Mika Mäntylä