The application of graphs to the analysis of distribution of loops in a program

In this paper a model of a program, in which loops are graph cycles, is given. From that model, a particular estimate of the number of loops passing through any program statement is derived. The method of obtaining a graph, whose paths are equivalent to program loops, is described. In the final section, the places at which the program should be divided into sections are given