Process design computations are represented by directed graphs whose edges correspond to streams of information flow between computational units. Algorithm I-R extends existing algorithms for finding the minimal sized blocks of units between which no recycle exists. Algorithm II-R orders the sequence of unit computations within a block to minimize the number of recycle parameters. Algorithm III-R uses the concept of indexing to order computations which evade algorithm II-R. This work is directed toward the evolution of efficient programs for computer-aided process design.