Abstract: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 ...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.Read More
Publication Year: 1976
Publication Date: 1976-12-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 5639
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot