-
Notifications
You must be signed in to change notification settings - Fork 30
/
CyclomaticComplexity.html
34 lines (33 loc) · 1.57 KB
/
CyclomaticComplexity.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
<!--
~ Copyright 2005-2020 Sixth and Red River Software, Bas Leijdekkers
~
~ Licensed under the Apache License, Version 2.0 (the "License");
~ you may not use this file except in compliance with the License.
~ You may obtain a copy of the License at
~
~ http://www.apache.org/licenses/LICENSE-2.0
~
~ Unless required by applicable law or agreed to in writing, software
~ distributed under the License is distributed on an "AS IS" BASIS,
~ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
~ See the License for the specific language governing permissions and
~ limitations under the License.
-->
<html>
<body>
<table>
<tr><td valign="top" height="150">
Calculates the Cyclomatic Complexity of each non-<b>abstract</b> method. Cyclomatic complexity
is a measure of the number of distinct execution paths through each method.
This can also be considered as the minimal number of tests necessary to completely exercise a method's control flow.
In practice, this is 1 + the number of <b>if</b>'s, <b>while</b>'s, <b>for</b>'s, <b>do</b>'s, <b>switch</b>
cases, <b>catch</b>es, conditional expressions, <b>&&</b>'s and <b>||</b>'s in the method.
<p><p>
For more information on the Cyclomatic Complexity metric read
<a href="https://en.wikipedia.org/wiki/Cyclomatic_complexity">the Wikipedia article</a>.
</td></tr>
<tr><td height="50">Abbreviation: <b>v(G)</b></td></tr>
<tr><td height="20"><small>Powered by MetricsReloaded</small></td></tr>
</table>
</body>
</html>