The division of an algorithm scheme into networks

The scheme of any computing algorithm is divided into three types of operator: calculating operators, logical operators and stops. Each logical operator corresponds to a logical function which can take one of two values, depending on the data for the computation. Different combinations of values of the logical functions lead to different sequences of operators, called chains. In order to faciliate the automatisation of programming, it is necessary to find a method whereby one computing algorithm scheme can be transformed into an equivalent one which is more convenient for the particular problem, and a suitable way of doing this is by analysing the chains in the original scheme. All the chains in a scheme are contained in networks which express a combination of cycles and chains. The article gives an algorithm which determines the networks in all possible cases.