The maximum number of linear, independent paths through a program. Cyclomatic complexity may be computed as L = N + 2P, where L = the number of edges/links in a graph, N = the number of nodes in a graph, P = the number of disconnected parts of the graph (e.g., a called graph or subroutine).

Original definition: Cyclomatic Complexity
@ISTQB
Glossary

Source: official ISTQB Glossary This page was created, because the original one is notoriously hard to work with.

Bare Hugo theme. Blog source code available on Github.