facebook / PathPicker
Conditional Complexity

The distribution of complexity of units (measured with McCabe index).

Intro
  • Conditional complexity (also called cyclomatic complexity) is a term used to measure the complexity of software. The term refers to the number of possible paths through a program function. A higher value ofter means higher maintenance and testing costs (infosecinstitute.com).
  • Conditional complexity is calculated by counting all conditions in the program that can affect the execution path (e.g. if statement, loops, switches, and/or operators, try and catch blocks...).
  • Conditional complexity is measured at the unit level (methods, functions...).
  • Units are classified in four categories based on the measured McCabe index: 1-5 (simple units), 6-10 (medium complex units), 11-25 (complex units), 26+ (very complex units).
Learn more...
Conditional Complexity Overall
  • There are 198 units with 1,166 lines of code in units (50.1% of code).
    • 0 very complex units (0 lines of code)
    • 1 complex units (39 lines of code)
    • 4 medium complex units (141 lines of code)
    • 8 simple units (126 lines of code)
    • 185 very simple units (860 lines of code)
0% | 3% | 12% | 10% | 73%
Legend:
51+
26-50
11-25
6-10
1-5
Alternative Visuals
Conditional Complexity per Extension
51+
26-50
11-25
6-10
1-5
py0% | 3% | 12% | 10% | 73%
rb0% | 0% | 0% | 0% | 100%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
src/pathpicker0% | 3% | 13% | 7% | 75%
src0% | 0% | 0% | 56% | 43%
ROOT0% | 0% | 0% | 0% | 100%
Most Complex Units
Top 50 most complex units
Unit# linesMcCabe index# params
39 28 2
41 14 1
30 14 2
29 13 2
41 11 2
24 10 1
15 8 2
23 8 2
8 7 1
20 6 0
15 6 1
14 6 1
7 6 0
16 5 1
25 5 1
6 5 2
10 5 2
13 4 1
7 4 1
9 4 1
9 4 0
25 4 0
11 4 0
5 4 0
7 3 4
7 3 2
24 3 2
10 3 1
6 3 1
16 3 1
9 3 1
6 3 1
6 3 1
11 3 1
8 3 2
8 3 2
7 3 1
3 3 1
14 3 4
9 3 2
11 2 1
5 2 1
4 2 2
4 2 2
4 2 1
8 2 1
13 2 1
11 2 1
5 2 1
12 2 1