Conditional Complexity Overall
  • There are 433 units with 3,273 lines of code in units (26.3% of code).
    • 0 very complex units (0 lines of code)
    • 0 complex units (0 lines of code)
    • 2 medium complex units (122 lines of code)
    • 14 simple units (458 lines of code)
    • 417 very simple units (2,693 lines of code)
0% | 0% | 3% | 13% | 82%
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
kt0% | 0% | 2% | 16% | 80%
py0% | 0% | 32% | 17% | 50%
java0% | 0% | 0% | 5% | 94%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
graphql-dgs0% | 0% | 7% | 30% | 61%
scripts0% | 0% | 32% | 17% | 50%
graphql-dgs-spring-boot-micrometer0% | 0% | 0% | 18% | 81%
graphql-dgs-spring-graphql0% | 0% | 0% | 6% | 93%
graphql-error-types0% | 0% | 0% | 12% | 87%
graphql-dgs-example-shared0% | 0% | 0% | 5% | 94%
graphql-dgs-client0% | 0% | 0% | 0% | 100%
graphql-dgs-reactive0% | 0% | 0% | 0% | 100%
graphql-dgs-spring-graphql-example-java0% | 0% | 0% | 0% | 100%
graphql-dgs-spring-graphql-example-java-webflux0% | 0% | 0% | 0% | 100%
graphql-dgs-pagination0% | 0% | 0% | 0% | 100%
graphql-dgs-extended-validation0% | 0% | 0% | 0% | 100%
graphql-dgs-example-jackson-both0% | 0% | 0% | 0% | 100%
graphql-dgs-example-jackson3-only0% | 0% | 0% | 0% | 100%
graphql-dgs-example-jackson2-only0% | 0% | 0% | 0% | 100%
graphql-dgs-extended-scalars0% | 0% | 0% | 0% | 0%
Most Complex Units
Top 50 most complex units
Unit# linesMcCabe index# params
59 17 1
63 16 3
23 9 0
34 9 3
40 9 2
31 9 1
47 8 3
9 7 1
11 7 1
21 7 2
94 7 1
29 7 2
40 6 2
8 6 1
28 6 2
43 6 3
36 5 2
55 5 10
17 5 2
23 5 2
14 4 0
9 4 3
18 4 1
13 4 2
44 4 3
16 4 2
25 4 1
20 3 3
13 3 2
8 3 2
12 3 1
9 3 1
10 3 1
13 3 2
6 3 2
10 3 1
8 3 1
17 3 3
21 3 0
39 3 1
9 3 2
13 3 2
17 3 2
11 3 4
30 2 1
15 2 1
15 2 1
18 2 2
12 2 2
14 2 5
About This Analysis
  • 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...