Revision as of 15:58, 21 July 2004 edit Taxman (talk \| contribs) 14,708 edits m bypassed disambig page ← Previous edit		Revision as of 20:36, 20 August 2004 edit undo Creidieki (talk \| contribs) Extended confirmed users, Rollbackers 3,838 edits m disambig function->function(programming) Next edit →
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 (programming)\|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.

Cyclometric complexity: Difference between revisions