On the use of the cyclomatic number to measure program complexity

Authors:
James L. Elshoff;Michael Marcotty
Affiliations:
General Motors Research Laboratories, Warren, Michigan;General Motors Research Laboratories, Warren, Michigan
Venue:
ACM SIGPLAN Notices
Year:
1978

Citing 6
Cited 7

A genealogy of control structures

Communications of the ACM
Letters to the editor: go to statement considered harmful

Communications of the ACM
Standardized Development of Computer Software

Standardized Development of Computer Software
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
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Sensitivity of graph-theoretic metrics to edge directions for structured and unstructured programs (abstract and references only)

CSC '91 Proceedings of the 19th annual conference on Computer Science
Improving computer program readability to aid modification

Communications of the ACM
The measurement of software design quality

Annals of Software Engineering
Splitting the Difference: The Historical Necessity of Synthesis in Software Engineering

IEEE Annals of the History of Computing
Analyzer-generated and human-judged predictors of computer program readability

CHI '82 Proceedings of the 1982 Conference on Human Factors in Computing Systems
The cyclomatic number and the normal number of programs

ACM SIGPLAN Notices
The PEEK measurement program

ACM SIGMETRICS Performance Evaluation Review

Quantified Score

Hi-index	0.02

Visualization

Abstract

The October 1977 issue of SIGPLAN Notices carries an article that compares functionally equivalent programs that differ in their internal structure. The basis for comparing the programs is a measure called cyclomatic complexity whose value is the cyclomatic number of the graph that corresponds to the flow of control of the program. One program is of particular interest since all of the well-structured versions of the program that are discussed have a higher cyclomatic complexity than the unstructured version. In this paper another well-structured version of the program is presented for which the cyclomatic complexity is reduced to that of the original unstructured version. In the process, some of the shortcomings of the cyclomatic number as a complexity measure are revealed.