A complexity measure based on selection and nesting

Authors:
Huisheng Gong;Monika Schmidt
Affiliations:
-;-
Venue:
ACM SIGMETRICS Performance Evaluation Review
Year:
1985

Citing 4
Cited 1

Flow Analysis of Computer Programs

Flow Analysis of Computer Programs
A complexity measure based on nesting level

ACM SIGPLAN Notices
Measurement of program complexity by the pair: (Cyclomatic Number, Operator Count)

ACM SIGPLAN Notices
An extension to the cyclomatic measure of program complexity

ACM SIGPLAN Notices

Reading beside the lines: Using indentation to rank revisions by complexity

Science of Computer Programming

Quantified Score

Hi-index	0.01

Visualization

Abstract

Many concepts concerning the quantification of program complexity have been developed during the last few years. One of the most accepted and easy-to-apply complexity measures, McCabe's cyclomatic number, has been discussed and improved in several studies. The cyclomatic number only considers the decision structure of a program. Therefore, this paper proposes a new method for calculating program complexity, the concept of postdomination. This takes into account the degree of nesting of a program. Combining this method and the cyclomatic number, a new complexity measure will be defined.