Applying Mccabe's complexity measure to multiple‐exit programs

Warren A. Harrison · Software Practice and Experience · 1984

Abstract The traditional short‐cut calculation for McCabe's complexity metric, π+1, does not handle the case of multiple‐exit flowgraphs. An alternative short‐cut calculation is presented that allows the metric to be applied to multiple‐exit programs.

Read the paper · More papers on PaperTik