JPH0654468B2 - Tree structure data drawing processing method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Industrial field of application] The present invention relates to a data processing device in which, when data such as input figures and characters are used as constituent elements of a tree structure diagram, the tree structure diagram is created and edited. The present invention relates to a tree structure data drawing processing method for outputting, etc., and particularly to a technology for automatically deciding the arrangement of graphic information so that the area required for displaying or recording the graphic information is small and is easy for the user to see. .

[Conventional technology]

Conventionally, data processing devices often handle tree-structured data. Especially during program development
Tree structure diagrams (charts) have become popular in place of the flow charts used in the past (Nikkei Computer, 19
84.1.9, P71). With the spread of high-performance workstations, tree structure diagrams have come to be handled by data processing devices (Nikkei Computer, 1987.8.1).
7, P149).

An apparatus for handling a tree structure diagram is, for example, JP-A-60-1.
There is a tree structure chart test processing device as described in Japanese Patent No. 00226. When handling tree structure data, it is necessary to determine the position of each element forming the tree structure and create a tree structure diagram, but the above publication does not describe this technique.

Further, regarding the creation of the tree structure diagram, JP-A-62-142
Japanese Patent Laid-Open Publication No. 65-65 discloses a method of drawing using parent-child relationship information between boxes when the boxes are constituent elements, that is, the arrangement when the constituent elements of the tree structure data are boxes.
It is disclosed that this can be derived from the logical relationship of the tree structure.

[Problems to be solved by the invention]

However, in the method of drawing using the parent-child relationship information between boxes when the conventional box is a constituent element, the coordinates of the constituent elements of the tree structure diagram are first left-justified, and then each constituent element is set. On the other hand, a correction value is obtained, and finally the correction value is used to determine the coordinates to be arranged. Therefore, there is a problem that the processing time increases as the number of constituent elements increases and the method of realizing the processing is complicated.

The present invention has been made to solve the above problems.

An object of the present invention is a tree structure data drawing processing method for drawing using parent-child relationship information between boxes when boxes are constituent elements, and the number of processing steps can be reduced.
Another object is to provide a technique capable of shortening the processing time.

Another object of the present invention is a tree structure data drawing processing method for drawing using parent-child relationship information between boxes when boxes are constituent elements, and the area required for displaying or recording graphic information is small, and The object is to provide a technology capable of automatically determining the arrangement of graphic information so that it is easy for the user to see.

The above and other objects and novel features of the present invention will be apparent from the description of this specification and the accompanying drawings.

[Means for solving problems]

The following is a brief description of the outline of the typical inventions among the inventions disclosed in the present application.

That is, it is a tree structure data drawing processing method for converting information having a parent-child / sibling relationship of a tree structure from an information storage medium holding tree structure information in a data processing device into graphic information and displaying or storing this graphic information. Then, when the parent-child / sibling relationship information is searched in the parent-child direction and further in the sibling direction, and reaches the lowest hierarchy having no children, the figures corresponding to the information belonging to the lowest hierarchy respectively. Until the top level is reached, the placement position of the information is determined, and then the placement position of the graphic information corresponding to the upper layer information is determined based on the user-set parameter information that determines the relative position between the upper and lower layers. It is characterized in that the graphic information of each layer is displayed or stored according to the arrangement position thus determined. Then, when searching from the parent to the child, if the parent has a child,
The feature is that the firstborn child is searched as a new parent in the child direction, and if there is no child, it is searched in the younger brother direction, and if a younger brother exists, the younger brother is searched as the new parent in the child direction.

Also, when deciding the placement position of the graphic information of the upper hierarchy,
If the placement position of the child's parent is determined, the existence of the younger brother is searched, and if the younger brother is present, the placement position of the child's parent is determined after determining the placement position of the child with the younger brother as the new parent. It is characterized by doing.

[Action]

According to the above-described means, when connecting a parent and a child of a tree structure, a tree structure diagram is created in a short time by a simple process using a recursive call when determining the placement of the child and the position of the parent. Further, since the balance is established based on the parameter information, a tree structure diagram that is easy to see is created.

[Principle of Invention]

According to the present invention, the positions of the constituent elements of the tree structure data are uniquely determined from the logical relationship of the tree structure data, and at that time, the arrangement balance can be set based on the parameter information given in advance. By using the recursive method as the realization method at this time, the positioning is performed by a very simple process, so that the realization method of the process can be simplified and the processing time can be shortened.

Next, the “recursive method” will be described.

A process is said to be recursive when it includes itself in the process. This is similar to the mathematical recurrence formula.

An example of finding the factorial by the recursive method is P! When = 1 and P = 0, P! = P * (P-1)! , P> 0 When written in Pascal language, it becomes as follows.

function F (I: integer): integer; begin if I> 0 then F: = I * F (I-1) else F: = 1 end This example is shown in the flow chart of FIG. .

When the above example is executed with I = 5, the operation is as follows.

F (5) = 5 * F (4) → F (4) is called F (4) = 4 * F (3) → F (3) 〃 F (3) = 3 * F (2) → F (2) 〃 F (2) = 2 * F (1) → F (1) 〃 F (1) = 1 * F (0) → F (0) 〃 F (0) = 1 → F (0) 1 is set F (1) = 1 → F (1) 1 〃 F (2) = 2 → F (2) 2 〃 F (3) = 6 → F (3) 6 〃 F (4 ) = 24 → F (4) = 24 〃 F (5) = 120 → F (5) 120 〃 [Embodiment of the Invention] An embodiment of the present invention will be specifically described below with reference to the drawings.

In all the drawings for explaining the embodiments, parts having the same function are designated by the same reference numerals, and repeated description thereof will be omitted.

FIG. 1 is a block diagram showing a schematic configuration of a tree-structured data processing device according to an embodiment of the present invention, and FIGS. 2 and 3 show an example of a flow chart (flow chart) of a position determination process according to the present invention. Explanatory diagram, FIG. 4 is an explanatory diagram showing an example of data in the tree structure information storage unit shown in FIG. 1, FIG. 5 is an explanatory diagram showing an example of positioning by the present invention, and FIG. FIG. 7 is an explanatory diagram showing a process of positioning by PAD (Problem Analysis) to which the present invention is applied.
FIG. 8 is an explanatory view showing an example of a text expression in a diagram, and FIG. 8 is an explanatory view showing an example in which the text according to the present invention is converted into a PAD diagram.

As shown in FIG. 1, the tree-structured data processing device of this embodiment includes an input device 1 including a keyboard and a mouse, a data processing device 2 including a computer, a display device 3 for displaying processed information, A printer 4 is provided for recording and printing the processed information. The data processing device 2 includes an input information conversion unit 21 for converting the information input from the input device 1 into tree structure information, and the input information conversion unit 21.
Tree structure information storage unit 2 for storing the information converted by
2. Read the information from the parameter information storage unit 23, the tree structure information storage unit 22 and the parameter information storage unit 23 for adding the parameter that determines the relative positional relationship between the upper and lower layers to the information input from the input device 1 Position determination processing unit 24 for performing the position determination processing of structural information, this position determination processing unit
The graphic / character information storage unit 25 for storing the graphic / character information of the tree structure determined in 24, this graphic / character information storage unit
A display unit 26 for displaying the information stored in 25 on the display device 3, and a printer output unit 27 for printing the information stored in the graphic / character information storage unit 25 on the printer 4.
It consists of

Next, the processing procedure of this embodiment will be described with reference to FIG. 1 and FIG.

1 and 2, the information input from the input device 1 is converted into tree structure information by the input information conversion unit 21 (steps 100 to 500). The result is stored in the tree structure information storage unit 22.

The information stored in the tree structure information storage unit 22 is, for example,
In the case of the tree structure diagram shown in FIG. 5, it is stored as shown in FIG. The position determination process operates based on the tree structure information and the input parameter information from the parameter information storage unit 23 (step 600). The result is a figure. Character information storage unit 25
Stored in the display unit 26 or the printer output unit 27.
It is output to the display device 3 such as RT or the printer 4.

Next, based on FIG. 3, an example in which the tree structure diagram shown in FIG. 5 is created from the tree structure data shown in FIG. 4 will be described.

In FIGS. 4 and 5, the elements that make up the tree structure are boxes, and node numbers are assigned to each. Node number 0
Is defined as the 0th hierarchy position, and the box of the N digit node number is called the Nth hierarchy position. The uppermost box of the boxes in the Nth layer points upward with respect to the box in the immediately preceding layer. For the child box,
Parents point to the right, and brothers point up and down.

In FIG. 3, first, the process is started by calling step 600 shown in FIG. 2 to step 601 shown in FIG. 3 for the box “0” (see FIG. 6). In step 602, the uppermost position is provisionally set for the box “0”, and it is determined in step 603 whether or not the right node (child tree) exists. The judgment is YE
If S, step 601 is called recursively for box "1" in step 604. If NO, the process proceeds to step 608. Similarly, box “111”
When the step 601 is called for the position of, the return value of the right node setting value is compared with the provisional setting value in step 605, and if they are equal, the position of the box “111” is defined in step 608. . If the temporary setting value is greater than the return value of the right node setting value, increase the right node setting value by the difference between the temporary setting value and the right node return value,
Step 608 defines the position of box "111". If the temporary setting value is smaller than the return value of the right node setting value, the temporary setting value is increased to the return value of the right node setting value to equalize it, and the position of the box “111” is defined (determined) in step 608. It Here, details of the steps 605, 606, 607, and 608 will be described.

If the determination in step 605 is “>”, the third
As shown in the figure, this corresponds to the case where the positional relationship between the temporary setting value of the parent nn and the right node return value (▽) is the relationship of the dotted line (a). In this case, the parent node nn is directly above ▽. To move the parent node nn to come to.

If the determination in step 605 is “=”,
As shown in FIG. 3B, the provisional setting value of the parent nn and the right node return value (∇) are the same value (same position). In this case, the provisional setting value of the parent node nn is used as it is as the parent node nn.
This is the set value.

If the determination in step 605 is “<”,
As shown in FIG. 3C, this corresponds to the case where the positional relationship between the provisional setting value of the parent nn and the right node return value (▽) is the point (b), and in this case, the right node return value (Δ). )
Move the entire child tree towards the parent so that is underneath the parent node nn.

Next, in step 609, it is determined whether or not a lower node (sibling tree) exists. If this determination is YES, the process moves to step 610 and the lower node, that is, the box “1”.
Step 601 is called for 12 "and" 113 ", and the respective positions are determined by step 608 [Fig. 6 (a)].

Next, when the determination in step 609 is NO, that is, since the lower node of the box “113” does not exist,
In step 611, the next connection position is obtained by the parameter. The next connection position obtained from the parameters in step 611 is the step 605, 606, 607.
It is the right node (setting) return value. As a result, the connection positions of the boxes “111” to “113” and the box “11” are determined. With this parameter,
The tree structure diagram can be the same as the example shown in FIGS. 9A and 9B.

Next, from the recursive call, the box “1
1 ”in step 604, the steps 605 to 606 are passed, and the step“ 608 ”is performed in the box“ 1 ”.
The position is determined to be 1 ". Then, step 601 is called for box" 12 "from step 610, and the position is determined by step 608 [Fig. 6 (b)]. In the box "0"
Is determined and the processing is completed, and step 600 shown in FIG.
Return to [Fig. 6 (C)]. The position reference in this embodiment is the upper part, and the lower the position, the larger the value indicating the position.

An example in which the above-described means is applied to the tree structure chart PAD is shown below.

FIG. 7 shows the symbols of the components of PAD.

The position of each symbol is determined by the present invention in correspondence with the text shown in FIG. 8 (a), and the PAD diagram shown in FIG. 8 (b) is created.

In FIG. 8, MOVE AA TO BB to MOVEWE
The positions of the three processing symbols corresponding to E TO FF are determined, and IF is determined from the connection relation with the IF symbol of condition 1.
The position of the symbol is determined, and the size of the IF symbol is determined based on the connection relationship between the condition 2 repeating symbol and the IF symbol.

As can be seen from the above description, according to the present embodiment, when a parent and child of a tree structure are connected, a simple process using a recursive call at the time of deciding the placement of the child and the position of the parent can be performed in a short time. A structural drawing is created. In addition, it is possible to draw a tree structure considering the balance. The balance at this time can be centered, moved in a certain direction, or set in the middle, depending on the parameter, so that the most legible drawing can be performed for various tree structure drawings.

The present invention has been specifically described above based on the embodiments,
It is needless to say that the present invention is not limited to the above-mentioned embodiments and can be variously modified without departing from the scope of the invention.

〔The invention's effect〕

As described above, according to the present invention, when a parent and a child of a tree structure are connected, a simple process using a recursive call when determining the placement of the child and the position of the parent can be performed in a short time in the tree structure diagram. Can be created. In addition, the tree structure diagram can be drawn based on the parameter information set in advance by the user in the parameter information storage unit. Thereby, for example, even if the position of the parent of the drawn tree is not suitable for the user, the user can correct the position.

In addition, since the balance is made based on the parameter information, it is possible to create a tree structure diagram that is easy to see.

[Brief description of drawings]

FIG. 1 is a block diagram showing a schematic configuration of a tree-structured data processing device according to an embodiment of the present invention, and FIGS. 2 and 3 are explanatory diagrams showing an example of a flow chart of a position determination process according to the present invention. FIGS. 3A, 3B and 3C are diagrams for explaining the flow chart of FIG. 3, and FIG. 4 is an explanatory diagram showing a data example of the tree structure information storage unit shown in FIG. FIG. 6 is an explanatory view showing an example of positioning according to the present invention, FIG. 6 is an explanatory view showing a process of positioning according to the present invention, and FIG. 7 is a tree structure diagram PAD (Problem) to which the present invention is applied.
Fig. 8 is an explanatory diagram showing an example of a text representation in an Analysis Diagram), Fig. 8 is an explanatory diagram showing an example in which the text according to the present invention is converted into a PAD diagram, and Fig. 9 is an explanatory diagram showing an example of a tree structure diagram. FIG. 10 is a flowchart for explaining an example of obtaining a factorial by a recursive method. In the figure, 1 ... Input device, 2 ... Data processing device, 3 ... Display device, 4 ... Printer, 21 ... Input information conversion unit, 22 ... Tree structure information storage unit, 23 ... Parameter information storage unit 24 ... Position determination processing unit , 25 ... Graphic / character information storage unit, 26 ... Display unit, 27 ... Printer output unit.

Front page continued (72) Inventor Hiroshi Usuda 6-81 Onoue-cho, Naka-ku, Yokohama-shi, Kanagawa Hitachi Software Engineering Co., Ltd. (56) References JP 62-14265 (JP, A) JP 58- 223863 (JP, A) "IEEE TRANSACTIONS ON SOFTWARE ENGINE RRING" 7 [2] (1981-3) P. 223-228

Claims (3)

[Claims] 1. A tree structure data drawing process for converting information having a parent-child / sibling relationship of a tree structure from an information storage medium holding tree structure information in a data processing device into graphic information and displaying or storing this graphic information. In the method, the information in the parent-child / sibling relationship is searched in a parent-to-child direction and further in a sibling direction, and if the lowest hierarchy having no children is reached, the information belonging to the lowest hierarchy is respectively The uppermost layer is to determine the placement position of the corresponding graphic information, and then determine the placement position of the graphic information corresponding to the upper layer information based on the user-set parameter information that determines the relative position between the upper and lower layers. A tree structure data drawing processing method characterized in that the graphic information of each layer is displayed or stored in accordance with the arrangement position thus determined. 2. When searching in the direction from the parent to the child, if the parent has a child, the eldest child is searched as the new parent in the child direction, and if there is no child, the younger brother is searched, and the younger brother exists. Then, the younger brother is searched as a new parent in the child direction, and the tree structure data drawing processing method according to claim 1. 3. When determining the arrangement position of the graphic information of the upper hierarchy, if the arrangement position of the parent of the child is determined, the existence of the younger brother is searched, and if the younger brother exists, the younger brother is newly added. The method for drawing tree-structured data according to claim 1, wherein the arrangement position of the child as a parent is determined, and then the arrangement position of the parent of the child is determined.