Cyclometric complexity: Difference between revisions

Content deleted Content added
Taxman (talk | contribs)
added links and ==See also==, removed stub notice
Taxman (talk | contribs)
m bypassed disambig page
Line 1:
'''Cyclometric complexity''' is a [[software metric]] concept in [[computational complexity theory]]. Its magnitude is denoted by the letter ("M"). "M" is defined to be one larger than the number of decision points (IFs, UNTILs, ENDs...) in a module ([[function]], [[procedure]], chart node, etc.), or more generally a [[system]].
 
McCabe's rule of thumb is that "modules" with M of ten or more are error-prone.