JPH01134674A - System for processing tree structure data drawing - Google Patents

Abstract

PURPOSE:To prepare tree structure in a short time by executing a positioning with simple processing to use a returning call when the master and slave of the tree structure and linked and the arrangement of the slave and the position of the master are determined. CONSTITUTION:Information to be inputted from an input device 1 are converted to tree structure information operation by an input information converting part 21 and a result is stored to a storing part 22. Based on these three structure information and input parameter information from a storing part 23, a positioning processing is executed in a processing part 24. The result is stored to a storing part 25 and outputted to a display device 3 of a CRT, etc., or a printer 4 by a display part 26 or a printer output part 27. On the other hand, when a tree structure chart is prepared from the three structure data, the positioning is executed with the simple processing to use the returning call in case of the master and slave of the tree structure are linked and the arrangement of the slave and the position of the master are determined. Accordingly, the realizing method of the processing goes to be simple and a processing time is shortened.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention provides a method for creating and editing a tree structure diagram when input data such as figures and characters is used as constituent elements of a tree structure diagram in a data processing device. , relates to a tree structure data drawing processing method for outputting etc., and in particular relates to a technology that automatically determines the arrangement of graphic information so that the area required for displaying or recording graphic information is small and it is easy for the user to see. .

[Conventional technology]

Conventionally, data processing devices often handle tree-structured data. Especially when developing a program,
A tree structure diagram (
chart) has become popular (Nikkei Computer, 198
4.1.9. P71).

Furthermore, with the spread of high-performance workstations, this structural diagram has come to be handled by data processing equipment (Nikkei Computer, 1987.8.17.Pi49).

As a device for handling tree structure diagrams, for example, JP-A-60-1
．． As described in Japanese Patent No. 0226, there is a tree structure chart test processing device. When dealing with tree structure data, it is necessary to determine the position of each element forming a single structure and create a tree structure diagram, but the above-mentioned publication does not mention this technique.

Regarding the creation of tree structure diagrams, please refer to JP-A-62-142
Publication No. 65 describes a method of drawing using parent-child relationship information between boxes when boxes are used as constituent elements, that is, the arrangement when the constituent elements of tree structure data are boxes.
It is disclosed that what can be derived from the logical relationships of this structure.

[Problem that the invention seeks to solve]

However, in the conventional drawing method using parent-child relationship information between boxes when boxes are used as constituent elements, coordinates are set for the constituent elements of the tree structure diagram by first aligning them to the left, and then each constituent element is The plot is drawn in three steps: finding a correction value for the object, and finally determining the coordinates for placement using the correction value.

Therefore, as the number of components increases, processing time increases, and the method for implementing the processing is also complicated.

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

An object of the present invention is to provide a tree structure data drawing processing method for drawing using parent-child relationship information between boxes when boxes are used as constituent elements, which is capable of reducing processing steps.
Another object of the present invention is to provide a technology that can shorten processing time.

Another object of the present invention is to provide a tree structure data drawing processing method for drawing using parent-child relationship information between boxes when boxes are used as constituent elements, which requires less area for displaying or recording figure information, and The object of the present invention is to provide a technology that can automatically determine the arrangement of graphic information so that it is easy for the user to view.

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

[Means for solving problems]

A brief overview of typical inventions disclosed in this application is as follows.

In other words, it is a tree structure data drawing processing method that converts information in parent-child/sibling relationships of a tree structure from an information storage medium holding tree structure information in a data processing device into graphic information, and displays or records this graphic information. A tree-structured data drawing processing method, the main feature of which is that the area required for displaying or recording the graphical information is small, and the layout of the graphical information is automatically determined so that it is easy for the user to see. According to the above, a tree structure diagram can be created in a short time by simple processing using recursive calls when connecting parents and children of a tree structure and determining the placement of children and the position of the parent. Furthermore, since balance is achieved based on parameter information, an easy-to-read tree structure diagram is created.

[Principle of the invention]

The present invention uniquely determines the positions of constituent elements of tree-structured data from the logical relationships of the tree-structured data, and at the same time, it is possible to set the balance of the arrangement based on parameter information given in advance. By using a recursive method as an implementation method at this time, positioning is performed with very simple processing, so that the implementation method of the processing can be simplified and the processing time can also be shortened.

Next, the ``recursive method'' will be explained.

When a process is implemented and itself is included in the process, it is said to be recursive. This is similar to a recurrence formula in mathematics.

To give an example of finding the factorial using the recursive method, p! =1
+ When p==o, PI=PX (P-1)l, when Pro, use this as Pa5c
When written in al language, it looks like this:

function F (1: intager)
: integer ;begin if I>
Othen F:=I*F (I-1) else
F:=1 end This example is shown in a flowchart as shown in FIG.

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

F(5)=5F(4)→F(4) is called F(
4)=4 skewers F(3)→F(3) F(3)=3 umbrellas F(2)→F(2) l/F(
2) = 2 proboscis F(1) → F(1) F(1) = 1ws F(0)) F(0) F(0) = 1
→1 is set in F(0) F(1) = 1
→F(1) to 1F(2)=2 →F(
2) to 2F(3) = 6 → F(3) to 6F(4
)=24 → F(4) to 24F(5)=120
→F(5) 120 [Embodiment of the Invention] Hereinafter, an embodiment of the present invention will be specifically described using the drawings.

In addition, in all the times for explaining the example.

Components having the same function are given the same reference numerals, and repeated explanations 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.

FIGS. 2 and 3 are explanatory diagrams showing examples of flowcharts of position determination processing according to the present invention.

FIG. 4 is an explanatory diagram showing an example of data in the tree structure information storage section shown in FIG. 1; FIG. 5 is an explanatory diagram showing an example of positioning according to the present invention; FIG. An explanatory diagram showing the process to be carried out, FIG. 7 is a PAD (Prob
FIG. 8 is an explanatory diagram showing an example of text expression in a PAD diagram according to the present invention.

As shown in FIG. 1, the tree-structured data processing apparatus of this embodiment includes an input device 1 consisting of a keyboard, a mouse, etc. A data processing device 2 consisting of a computer is equipped with a display device 3 for displaying processed information, and a printer 4 for recording and printing the processed information. The data processing device 2 includes an input information conversion unit 21 for converting information input from the input device 1 into tree structure information operations. A tree structure information storage section 22 for storing information converted by the input information conversion section 21. A parameter information storage unit 23 for adding parameters to information input from the input device 1, a position for reading out information in the tree structure information storage unit 22 and parameter information storage unit 23, and performing processing for determining the position of the information. A determination processing section 24, a graphic/character information storage section 2 for storing the graphic/character information processed by the position determination processing section 24.
5. A display section 26 for displaying the information stored in the graphic/character information storage section 25 on the display device 3; a printer for printing the information stored in the graphic/character information storage section 25 on the printer 4; It consists of an output section 27.

Next, the processing procedure of this embodiment will be explained using FIGS. 1 and 2.

In FIGS. 1 and 2, information input from the input device 1 is converted into tree structure information operations by the input information converter 21 (steps 100 to 500).

The result is stored in the tree structure information storage section 22.

For example, in the case of the tree structure diagram shown in FIG. 5, the information stored in the tree structure information storage section 22 is stored as shown in FIG. 4. Position determination processing is performed based on this tree structure information and input parameter information from the parameter information storage section 23 (step 600). The results are stored in the graphic/character information storage section 25 and displayed on the display section 26 or the printer output section 2.
7, the image is output to a display device 3 such as a CRT or a 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 explained.

In FIGS. 4 and 5, the elements constituting the tree structure are boxes, and each node is given a node number.

The box with node number 0 is defined as the 0th hierarchy position, and the
The box with the number of the digit node is called the Nth hierarchy position. The top box among the boxes in the N-th hierarchy points upward with respect to the box in the previous hierarchy. For child boxes, the parent points to the right, and for siblings, the top and bottom point to each other.

In FIG. 3, the process starts by calling the box 110 I+ from step 600 shown in FIG. 2 to step 601 shown in FIG. 3 (see FIG. 6). In step 602, the top position of box "o" is provisionally set, and in step 603, it is determined whether a right node (child tree) exists. That judgment is Y
If ES, in step 604 box 111 I+
Step 601 is called recursively. No
If so, proceed to step 608. Similarly, when step 601 is called for the position of box "111", step 605 compares the return value of the right node setting value with the temporary setting value, and if the two are equal, step 608
defines the position of box "111". When the temporary setting value is larger than the return value of the right node setting value, the right node setting value is increased by the difference between the temporary setting value and the right node return value, and the position of the box "'111" is defined in step 608. , when 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 make it equal, and the position of the box "111" is defined (determined) in step 608. .

Next, in step 609, it is determined whether 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”
Steps are called for 12''', ``113'',
Each position is determined in step 608 [FIG. 6(a)].

Next, if the determination at step 609 is NO, that is, there is no lower node of box "113," then step 611 determines the next connection position using the parameters. As a result, boxes 11111” to “113”
” and the box “11” are determined. By using these parameters, a tree structure diagram can be created as shown in the examples of FIG. 9 (a) and (b).

Next, from the recursive call, box "1" is entered by step 612.
1", returns to step 604, passes through steps 605 and 606, and returns to box "1" in step 608.
Then, step 601 is called for box "12" from step 610, and the position is determined in step 608 [Figure 6(b)]. In this way, the positions are determined one after another, and finally box/#
Once OI+ is determined, the process ends and returns to step 600 shown in FIG. 2 [FIG. 6(C)].

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

FIG. 7 shows symbols of the components of PAD.

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

In Figure 8, MOVE AA To BB-MOV
The positions of the three processing symbols corresponding to E EE To FF are determined, the position of the IF symbol is determined from the connection relationship with the IF symbol of condition 1, and then condition 2 is determined.
The size of the IF symbol is determined by the connection relationship between the repetition symbol and the IF symbol.

As can be seen from the above explanation, according to this embodiment, when connecting the parent and child of the tree structure, when determining the placement of the child and the position of the parent, a simple process using recursive calls can be used in a short time. A tree structure diagram is created. Also, when creating a tree structure diagram, you can draw it with balance in mind. The balance at this time can be centered, moved toward a certain direction, or set in the middle depending on the parameters, so that the most legible drawings can be made for various tree structure drawings.

The present invention has been specifically explained above based on examples, but
It goes without saying that the present invention is not limited to the embodiments described above, and can be modified in various ways without departing from the spirit thereof.

〔Effect of the invention〕

As explained above, according to the present invention, when connecting a parent and child in a tree structure, when determining the arrangement of children and the position of the parent, a simple process using recursive calls can be used to quickly complete the book. A structure diagram is created. Furthermore, since balance is achieved based on parameter information, an easy-to-read tree structure diagram is created.

[Brief explanation of the drawing]

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; FIGS. 2 and 3 are explanatory diagrams showing an example of a flowchart of a position determination process according to the present invention; FIG. 4 is an explanatory diagram showing an example of data in the tree structure information storage section shown in FIG. 1. FIG. 5 is an explanatory diagram showing an example of positioning according to the present invention. FIG. 6 is an explanatory diagram showing the process of positioning according to the present invention, and FIG. 7 is a tree structure diagram PAD (Prob
Fig. 8 is an explanatory diagram showing an example of text expression in a PAD diagram according to the present invention; Fig. 9 is an explanatory diagram showing an example of a tree structure diagram. 10 are flowcharts for explaining an example of calculating a factorial using a recursive method. In the figure, 1... input device, 2... data processing device, 3
Display device, 4 Printer, 21 Input information converter, 22 Tree structure information storage 23 Parameter information storage 24 Position determination processor 25
...Graphic/character information storage section, 26...Display section, 27
...This is a printer output section.

Claims (3)

[Claims] (1) A tree-structured data drawing processing method that converts information in a tree-structured parent-child/sibling relationship from an information storage medium holding tree-structured information into graphical information in a data processing device, and displays or records this graphical information. A tree structure data drawing processing method, characterized in that the area required for displaying or recording the graphic information is small and the layout of the graphic information is automatically determined so that it is easy for the user to see. (2) The tree structure data drawing processing method according to claim 1, wherein the graphic information can be created using an input device that allows a user to input a graphic or text. (3) The tree structure information can be created by a tree structure relationship extraction device from an information storage medium that holds information that is not stored as tree structure information from which tree structure relationships can be extracted. The tree structure data drawing processing method described in Section 1.