Generalized structured programs and loop
โ
Ward Douglas Maurer
๐
Article
๐
2007
๐
Elsevier Science
๐
English
โ 440 KB
Any directed graph, even a flow graph representing "spaghetti code", is shown here to have at least one loop tree, which is a structure of loops within loops in which no loops overlap. The nodes of the graph may be rearranged in such a way that, with respect to their new order, every edge proceeds i