## Warning: Removed 12 rows containing non-finite values (`stat_bin()`).
## All dependencies are approved.
The styling is based on the following style guide:
Cyclomatic Complexity is a software metric used to indicate the complexity of a program. It is a quantitative measure of the number of linearly independent paths through a program’s source code. It was developed by Thomas J. McCabe, Sr. in 1976.
And is calculated as follows: \(M = E - N + 2P\)
The complexity score is interpreted as follows:
- 1-10 Simple procedure, little risk
- 11-20 More complex, moderate risk
- 21-50 Complex, high risk
- >50 Untestable code, very high risk