FAQ

Cyclomatic complexity

Known as: Cyclic complexity, McCabe complexity, McCabe Cyclomatic Complexity 
Cyclomatic Complexity is a software metric (measurement), used to indicate the complexity of a program. It is a quantitative measure of the number of… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1966-2016
010203019662016

Related topics

Related topics

43 relations
ABC scoreBasic blockBasis path testingBetti number
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Cyclomatic complexity
Structured programming
Modular programming
Software metric
Software engineering
Control flow

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Cyclomatic Complexity
The cyclomatic complexity (CC) metric measures the number of linearly independent paths through a piece of code. Although Thomas… (More)
Is this relevant?
2014
2014
Cyclomatic complexity metric for component based software
Suitable Component Based Software (CBS) metrics are necessary for the efficient quantification of quality attributes of a system… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
Cyclomatic complexity: The nesting problem
Cyclomatic complexity is a metric for the measurement of complexity of a software. This metric although widely cited has many… (More)
  • figure 2
  • figure 1
  • figure 6
Is this relevant?
2009
2009
Cyclomatic Complexity and Lines of Code: Empirical Evidence of a Stable Linear Relationship
Researchers have often commented on the high correlation between McCabe’s Cyclomatic Complexity (CC) and lines of code (LOC… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • table 3
Is this relevant?
2004
2004
The theoretical extension of two versions of cyclomatic complexity to multiple entrylexit modules
Two versions of cyclomatic complexity are reanalysed and evaluated theoretically for cases of (a) modularization to eliminate… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
Computing Cyclomatic Complexity with Cubic Flowgraphs
Two new methods for the computation of cyclomatic complexity especially for decomposable representations are introduced. Building… (More)
  • table 1
  • figure 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Structured Testing: A Testing Methodology Using the Cyclomatic Complexity Metric
................................................................................................ iii 
  • figure 1-1
  • figure 2-1
  • figure 2-2
  • figure 2-3
  • figure 2-4
Is this relevant?
1994
1994
Technical Correcspondence: Clarrification concerning modularization and McCabe's cyclomatic complexity
CORRESPONDENCE T he December 1999 issue of C o m m u n i c a t i o n s contains a technical correspondence by Brian Henderson… (More)
  • figure I
Is this relevant?
1993
1993
Cyclomatic Complexity: theme and variations
Focussing on the "McCabe family" of measures for the decision/logic structure of a program, leads to an evaluation of extensions… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
Highly Cited
1988
Highly Cited
1988
A critique of cyclomatic complexity as a software metric
McCabe’s cyclomatic complexity metric is widely cited a s a useful predictor of various software attributes such a s reliability… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?