Skip to Main Content
Article navigation

A comparison of the Halstead and McCabe methods of measuring program complexity with a recently proposed metric, which is based on the analysis of dependency computations using a data flowgraph model, is presented. The sensitivity of the metric to changes in the data structure is discussed. Comments and criticisms of the measures are included.

This content is only available via PDF.
You do not currently have access to this content.
Don't already have an account? Register

Purchased this content as a guest? Enter your email address to restore access.

Please enter valid email address.
Email address must be 94 characters or fewer.
Pay-Per-View Access
$41.00
Rental

or Create an Account

Close Modal
Close Modal