Cyclometric complexity

This is an old revision of this page, as edited by 216.65.64.57 (talk) at 23:39, 26 October 2003. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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.