cyclic complexity

Cyclic complexity (also known as cyclomatic complexity) is a way of measuring the size and complexity of a computer program. It looks at the number of sections (called "paths") that the program takes to do something. It's like making a map of the program, and it helps to understand if the program is too confusing and complicated.