On the use of the cyclomatic number to measure program complexity

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.

REFERENCES

• 1: McCabe, T. J., "A complexity measure," IEEE Transactions on Software Engineering, Vol. SE-2, No. 4, Dec. 1976, pp. 308--320.
• 2: Narsingh Deo, Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation), Prentice-Hall, Inc., Upper Saddle River, NJ, 1974
• 3: Barth, C. W., "Notes on the CASE statement," Software-Practice and Experience, Vol. 4, No. 3, July 1974, pp. 289--298.
• 4: Glenford J. Myers, An extension to the cyclomatic measure of program complexity, ACM SIGPLAN Notices, v.12 n.10, p.61-64, October 1977 [doi>10.1145/954627.954633]
• 5: Robert C. Tausworthe, Standardized Development of Computer Software, Prentice Hall PTR, Upper Saddle River, NJ, 1977
• 6: Mills, H. D., "Mathematical foundations for structured programming," Document FSC72--6012, IBM Federal Systems Division, Gaithersburg, Maryland, Feb. 1972.
• 7: Ashcroft, E., and Manna, Z., "The translation of 'GOTO' programs to 'WHILE' programs," Proceedings of the 1971 IFIP Congress, Ljubljana, Yugoslavia, Aug. 1971, pp. 250--255.
• 8: Edsger W. Dijkstra, Letters to the editor: go to statement considered harmful, Communications of the ACM, v.11 n.3, p.147-148, March 1968 [doi>10.1145/362929.362947]
• 9: Wilfred J. Hansen, Measurement of program complexity by the pair: (Cyclomatic Number, Operator Count), ACM SIGPLAN Notices, v.13 n.3, p.29-33, March 1978 [doi>10.1145/954373.954375]
• 10: Henry F. Ledgard , Michael Marcotty, A genealogy of control structures, Communications of the ACM, v.18 n.11, p.629-639, Nov. 1975 [doi>10.1145/361219.361222]