Cyclomatic complexity of code is a quantitative measure created by Thomas McCabe to determine how many linearly independent paths a piece of code contains.