Answers are grounded in this paper and cite their sources.
Theoretical analysis demonstrates a graph-theoretic metric for software complexity in Fortran programs, indicating that program complexity depends entirely on decision structure rather than...
This paper describes a graph-theoretic complexity measure and illustrates how it can be used to manage and control program complexity. The paper first explains how the graph-theory concepts apply and gives an intuitive explanation of the graph concepts in programming terms. The control graphs of several actual Fortran programs are then presented to illustrate the correlation between intuitive complexity and the graph-theoretic complexity. Several properties of the graph-theoretic complexity are then proved which show, for example, that complexity is independent of physical size (adding or subtracting functional statements leaves complexity unchanged) and complexity depends only on the decision structure of a program.
No takes yet. Share an insight, caveat, or question.
Thomas J. McCabe (1976) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: