Cyclomatic complexity: Difference between revisions

Content deleted Content added
Taxman (talk | contribs)
somewhat indelicately merge in the article that was erroneously at Cyclometric complexity.
+ link
Line 1:
'''Cyclomatic complexity''' is a [[software metric]] (measurement) concept in [[computational complexity theory]]. It was developed by [[Thomas McCabe]] and is used to generally measure the complexity of a program. It directly measures the number of linearly independent paths through a program's [[source code]].
 
The concept, although not the method, is somewhat similiar to that of general text complexity measured by the [[Flesch-Kincaid Readability Test]].