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

In a r e c e n t paper, McCabe [1976] i n t r o d u c e d the cyclomatic number of a program's flow graph as a measure of its complexity. Myers [1977] proposed an improved measure consisting o[ an interval with the original measure as its upperbound. I will argue below that--if two values are to be presented as a measure--it is preferable to couple a variation of the cyclomatic number with a measure o[ the prog~-am's express:ion complexity.