An algorithm for converting signed digraphs to Forrester schematics is described and illustrated. A theoretical frame-work for the algorithm consisting of theorems is developed first. This theoretical framework is based upon discussions found in a companion paper . Specifically, the algorithm uses the definitional properties of the various quantities and couplings, the consistency supposition, and related axioms and theorems as outlined in . The algorithm is applied to an illustrative example.