CyclomaticComplexity.md (497B)
1 # Cyclomatic Complexity 2 3 **Source:** Orion Fuzzing Paper 4 5 **Definition:** Cyclomatic complexity is a metric used to indicate the complexity of a program. The metric is the number of linearly independent paths through a program's source code. 6 7 This metric can be calculated with a control-flow graph of the program. 8 9 If there are no conditionals in source code, the complexity is 1. If there is a single if conditional, the complexity is 2. Two nested if conditionals results in a complexity of 3.