Generation of the Hichart Program Diagrams

概要

論文の詳細を見る
This paper concerns methods of generating tree-structured program diagrams. The first part introduces an implementation of a system for generating Hichart [1, 7] diagrams. The drawing of the diagrams is then discussed. Several eumorphous conditions are formalized for tree-structured diagrams that consist of non-uniform sized cells. Some are conversions of conditions for trees [2-4], and some are extensions of recent results [12]. It is shown that some eumorphous conditions correspond to O(n) and O(n^4) time complexity algorithms and to an NP-hard problem, analogously to conditions for trees [6]. Finally, several methods are introduced that provide diagrams satisfying eumorphous conditions introduced here. It is noted that this system for generating Hichart program diagrams is the first that employs formalized eumorphous conditions and corresponding formalized methods, and that the results given in this paper can be applied to all tree-structured diagrams, including PAD, SPD, and TSF program diagrams.
一般社団法人情報処理学会の論文
1992-10-31