An extension to the cyclomatic measure of program complexity

Explore this paper's citation graph

Summary

A graph-theoretic measure of program complexity, where a program's complexity is assumed to be only a factor of the program's decision structure, is described and a simple extension to the measure is described to eliminate anomalies.

Type
article
Published
1977-10-01
Cited by
170
References
2
Access
Open access

Keywords

Measure (data warehouse), Computer science, Cyclomatic complexity, Extension (predicate logic), Simple (philosophy)

References

Cited by

Related papers