On structuring flowcharts (Preliminary Version)
S. Rao Kosaraju · 1976
Cooper's syntactic transformations for structuring flowcharts are studied. After exhibiting major problems with these transformations, a modified set of transformations are proposed. It is proved that a flowchart G is transformable into a D-chart if and only if for every 3 connected circuits C1, C2 and C3 in G, there exists a vertex v on C1+C2+C3 such that for every i, Ci passes through v or every path from Ci to the OUT of the flowchart passes through v.