Cyclometric complexity: Difference between revisions

Content deleted Content added

Revision as of 23:39, 26 October 2003 edit 216.65.64.57 (talk) No edit summary		Latest revision as of 22:23, 24 February 2005 edit undo Taxman (talk \| contribs) 14,708 edits merge content into the correctly named article at Cyclomatic complexity. Leave history here for reference
(11 intermediate revisions by 6 users not shown)
Line 1: #REDIRECT [[Cyclomatic_complexity]] ~~Cyclometric complexity ("M") is one larger than the number of decision points (IFs, UNTILs, ENDs...)in a module (function, procedure...).~~ ~~McCabe's rule of thumb is that "modules" with M of ten or more are error-prone.~~ ~~CASE structures are an exception. They can have more than ten decisions without increasing the likelihood of errors.~~