Jump to content

Cyclometric complexity

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Michael Hardy (talk | contribs) at 02:27, 27 October 2003. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Cyclometric_complexity&oldid=3435554"