From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on
	ip-172-31-74-118.ec2.internal
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=3.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.5-pre1
Date: 4 Jun 93 23:53:32 GMT
From: sullivan@beaver.cs.washington.edu  (Kevin Sullivan)
Subject: Re: McCabe package for Ada?
Message-ID: <1993Jun4.235332.5880@beaver.cs.washington.edu>
List-Id: <comp.lang.ada>

shanks@saifr00.cfsat.honeywell.com (Mark Shanks) writes:
> . . .
>As I understand it, the cyclomatic complexity - extended McCabes
>is a count of conditions (IFs, ELSEIFs, AND THENs, etc.) in a
>procedure + 1. 

The following may be of interest.  

Gill, G. K. and Kemerer, C. F., "Cyclomatic complexity density and software
maintenance productivity," IEEE Transactions on Software Engineering 17,12,
pp. 1284--8, Dec. 1991.

"The cyclomatic complexity metric is a measure of the maximum number of
linearly independent circuits in a program control graph. . . .  a simple
transformation of the metric is investigated whereby the cyclomatic
complexity is divided by the size of the system in source statements.
-- 
Kevin Sullivan
Department of Computer Science and Engineering, FR-35
University of Washington
Seattle, WA 98195