JP3671461B2 - Hierarchical chart processing device - Google Patents

Description

[0001]
[Industrial application fields]
The present invention relates to a hierarchical diagram processing apparatus that processes a hierarchical diagram drawn by hierarchically connecting a plurality of components.
[0002]
[Prior art]
Conventionally, when drawing a diagram with a hierarchical structure such as an in-house organization chart, it is configured in units of blocks for each department based on the hierarchical relationship between the departments, members, etc., which are constituent elements of the in-house organization, and the department unit. Members are arranged hierarchically, and department blocks are arranged hierarchically so as to clarify the hierarchical relationship between the departments, and an organization chart is created.
[0003]
In addition, organizations are often started and changed based on the above organization chart, but these operations are performed on the paper on which the organization chart is printed. For the change data such as the assigned department code and employee code, another work is required to input data to the system that created the organization chart.
[0004]
[Problems to be solved by the invention]
However, in the start-up and change work of the organization by the simulation using such a conventional organization chart, the change data such as the department code or the employee code that is changed or newly given for each department block in the simulation work However, there was a problem as described below because it was necessary to perform another operation to input data to the system that created the organization chart.
[0005]
In other words, in the work of simulating the start and change of the organization based on the organization chart, since it is done on a paper with the organization chart printed on trial and error, the data (department code, employee code, etc.) on the determined organization is Data has to be manually input based on this new organization chart, and there has been a problem that a data input error or the like has occurred, and that a similar error is likely to occur when an affiliation code is assigned.
[0006]
An object of the present invention is to automate the generation of a record for each component of a changed hierarchy diagram and the assignment of an affiliation code to each component when an organization is created or changed using the displayed hierarchy diagram Thus, it is possible to prevent data input mistakes due to manual input and reduce the work load.
[0007]
[Means for Solving the Problems]
According to the first aspect of the present invention, there is provided display means for displaying a hierarchical diagram in which a plurality of constituent elements are connected in a hierarchical connection structure, and hierarchical connection relationship information between the constituent elements of the displayed hierarchical diagram and other constituent elements. Analyzing and creating a record composed of the hierarchy in which the component is located for each component and the subordinate and affiliation information, a hierarchy storage means for preliminarily storing setting values corresponding to the hierarchy, and the record creation The records corresponding to the respective constituent elements created by the means are sequentially read out, and the set values corresponding to the hierarchies in the read records are read out from the hierarchical storage means, and for each record based on the set values Code generation means for generating different affiliation codes for lower affiliation information and peer affiliation information, and a record for assigning the affiliation code generated by the code generation means to the record Characterized by comprising a formation unit.
[0008]
According to a second aspect of the present invention, the code generation means includes code storage means for temporarily storing codes for each hierarchy, the read set value is written as a code in the code storage means, and the hierarchy of the read records Accordingly, the code in the code storage means is updated to generate different belonging codes.
[0009]
[Action]
According to the first aspect of the present invention, the display means displays a hierarchical diagram in which a plurality of constituent elements are connected in a hierarchical connection structure, and the record creation means includes the constituent elements of the displayed hierarchical diagram and other constituent elements. The connection relation information of the hierarchy is analyzed, and a record composed of the hierarchy where the component is located for each component and the subordinate and affiliation information is created and corresponds to each component created by the record creation means Sequentially read the recorded records. The code generation means sequentially reads records corresponding to the respective components created by the record creation means, and reads setting values corresponding to the hierarchy in the read record from the hierarchy storage means. In addition, different affiliation codes are generated for lower affiliation information and peer affiliation information based on the set values. The record generation means assigns the affiliation code generated by the code generation means to the record.
[0010]
According to a second aspect of the present invention, the code generation means includes code storage means for temporarily storing codes for each hierarchy, and writes the read setting values as codes to the code storage means, and the read records The code in the code storage means is updated in accordance with the hierarchy of each of the codes, and generated as different belonging codes.
[0011]
Therefore, based on the displayed hierarchy diagram, it analyzes the connection information of the hierarchy between the components of the hierarchy diagram and other components, creates a record for each component, and assigns the membership code based on the hierarchy Can be generated and assigned to each record, so the affiliation code corresponding to the hierarchy chart can be automatically generated, even if it is a complicated organization chart, compared to entering the affiliation code manually. In addition to preventing input mistakes, it is possible to automatically generate affiliation codes using the displayed hierarchy diagram.
[0012]
【Example】
Hereinafter, embodiments of the present invention will be described in detail with reference to FIGS.
1 to 11 are diagrams showing an embodiment of a computer system to which the present invention is applied.
First, the configuration will be described.
FIG. 1 is a block diagram of a main part of a computer system 1 according to the present embodiment.
[0013]
In FIG. 1, a computer system 1 includes a CPU 2, an input unit 3, a hierarchy diagram drawing editor 4, a drawing memory 5, a creation record buffer 6, an affiliation record creation unit 7, a record memory 8, a hierarchy code memory 9, and a rule table 10. , The affiliation record file 11 and the display unit 12, and each unit is connected to the bus 13.
[0014]
A CPU (Central Processing Unit) 2 controls various parts in the computer system 1 according to various control programs stored in a built-in ROM, executes various information processes, and causes the display part 11 to display the processing process and processing results. . In addition, the CPU 2 draws an organization chart having a hierarchical structure in the drawing memory 5 by the hierarchy diagram drawing editor 4 in accordance with an instruction from the input unit 3 in the affiliation file creation process described later, and the affiliation record creation unit 7 describes the affiliation described later. The record setting process and the affiliation code setting process are executed, and an affiliation record including connection relation information is set for each component (affiliation name block) of the drawn organization chart, and is set corresponding to the number of layers. Set the affiliation code based on the interval value.
[0015]
The input unit 3 includes a cursor key, a numeric input key, various function keys, and the like. In the hierarchical diagram drawing process of the affiliated file creation process, items necessary for drawing the organization chart, development positions of each department block, connection Various instruction contents such as relationships are output to the hierarchical diagram drawing editor 4.
The hierarchy diagram drawing editor 4 performs various instructions such as items necessary for drawing the organization chart input from the input unit 3, the development position of each department block, and the connection relationship in the hierarchy diagram drawing process of the belonging file creation process. Based on the contents, the image data of the organization chart having a hierarchical structure is drawn in the drawing memory 5, and the organization chart is displayed on the display unit 12.
[0016]
As shown in FIG. 2, the drawing memory 5 forms a memory area (blocks 1 to 20) in which image data of an organization process chart developed by the hierarchical diagram drawing editor 4 is developed in units of blocks for each department. The created record buffer 6 forms a memory area for temporarily storing the affiliated record data being processed when the affiliated record creating unit 7 executes the affiliated record setting process.
[0017]
The affiliation record creation unit 7 executes an affiliation record setting process and an affiliation code setting process, which will be described later, according to instructions from the CPU 2. For each block of the hierarchy diagram drawn in the drawing memory 5 by the hierarchy diagram drawing editor 4, In addition to setting the affiliation record based on the connection relationship, the affiliation name, the number of hierarchies, etc., the connection relationship is analyzed for each affiliation block set in the hierarchy diagram based on the content of the affiliation record and the setting content of the rule table 10 When the affiliation code is set and the creation of the affiliation record for each block is completed, it is stored in the affiliation record file 11.
[0018]
The record memory 8 forms a memory area for storing the belonging record data set in the created record buffer 6 by the belonging record setting process of the belonging record creating unit 7.
[0019]
The hierarchical code memory 9 forms a memory area as shown in FIG. 3, and when adding the hierarchy interval value of the belonging record for each hierarchical diagram block created by the belonging record creating unit 7, the hierarchy of the target block This is a memory for temporarily storing the hierarchy interval value by number. As shown in FIG. 4, the rule table 10 is a table that sets interval values corresponding to the number of layers in the hierarchy diagram drawn in the drawing memory 5.
[0020]
The affiliation record file 11 stores affiliation record data that has been created by the affiliation record creation unit 7. The display unit 12 is configured by a CRT (Cathode Ray Tube) or the like, and displays display data input from the CPU 2.
[0021]
Next, the operation of this embodiment will be described.
First, the belonging file creation process executed in the computer system 1 of this embodiment will be described based on the flowchart shown in FIG.
When the affiliation file creation process is started by the CPU 2, it is based on the contents necessary for drawing the hierarchical organization chart input from the input unit 3, various instruction contents such as development positions of each department block, connection relations, and the like. The hierarchical chart drawing editor 4 draws the organization chart image data having a hierarchical structure in the drawing memory 5 by setting one affiliation name in one area shown in FIG. 2 (step S1). Then, a link line is drawn (step S2), and the organization chart is displayed on the display unit 12.
An example of an organization chart drawn in the drawing memory 5 by this hierarchical diagram drawing process is shown in FIG. In FIG. 6, “A to E” are affiliation names.
[0022]
Next, the affiliation record setting unit 7 executes affiliation record setting processing on the organization chart drawn in the drawing memory 5 (step S3). This affiliation record setting process will be described based on the flowchart shown in FIG.
First, the first area in the drawing memory 5 is designated (step P1), and it is checked whether or not a name is drawn in the first area (step P2). In the organization chart of FIG. 6, since the name is not drawn in the first area, the next second area is designated in step P13, and it is checked whether or not it is the final area (step P14). Since it is not the final area, the process returns to Step P2, and since the name A is drawn in the second area, the created record buffer 6 is cleared (Step P3), the belonging name A of the second area, the number of hierarchies 1 The display x and y coordinate data are set in the created record buffer 6 (step P4).
[0023]
Next, it is checked whether or not the lower link line is drawn from the second area to the lower area (step P5). In FIG. 6, since the lower link line is drawn from the second area to the lower sixth area, The affiliation name B of the link destination is set in the created record buffer 6 as lower affiliation information (step P6). Further, it is checked whether or not an upper link line is drawn from the second area to the upper area (step P7). Since there is no upper area from the second area in FIG. The record data set in is stored in the record memory 8.
[0024]
At this time, the structure of the record data stored in the record memory 8 is shown in FIG. As shown in FIG. 8, the record data sets the data of the affiliation code, affiliation name, number of layers, higher affiliation, peer affiliation, lower affiliation, x coordinate, and y coordinate set in the affiliation code setting process described later. It has a configuration. In the case of the name A block in the second area, as shown in (1) of FIG. 9, A is assigned as the affiliation name, 1 as the number of hierarchies, B as the lower affiliation, and display x and y coordinates (not shown) are set.
[0025]
When the next area of the drawing memory 5 is designated in step P13 and the process of returning to step P2 and checking for the presence of a name is repeatedly executed, the name B is drawn in the sixth area. Is cleared (step P3). Set the affiliation name B, number of hierarchies 2, display x and y coordinates of the sixth area in the created record buffer 6 (step P4), and check whether the lower link line is drawn from the sixth area to the lower area (Step P5). In FIG. 6, since the lower link line is drawn from the sixth area to the eleventh area, the affiliation name D of the link destination is set in the created record buffer 6 as lower affiliation information (step P6).
[0026]
Further, it is checked whether or not an upper link line is drawn from the sixth area to the upper area (step P7). In FIG. 6, since the upper link line is drawn from the sixth area to the upper second area, The name A of the link destination area is set in the created record buffer 6 as higher-level affiliation information (step P8). Then, a record having the same high-level affiliation and no record data set to the same affiliation yet is searched from the hierarchical memory of the drawing memory 5 (step P9), and the presence or absence of the record is determined (step P10).
[0027]
In FIG. 6, since the affiliation name C is drawn in the eighth area of the number of hierarchies 2 in which the affiliation name A and the upper affiliation are the same, the eighth area which is the current area as the name of the affiliation belonging to the search record. Is set in the created record buffer 6 (step P11). Next, the record data (affiliation name B, number of hierarchies 2, upper affiliation A, peer affiliation C, lower affiliation D, display x and y coordinates not shown) set in the created record buffer 6 are shown in (2) in FIG. In this way, the record memory 8 is set (step P12), and the next area is designated in step P13.
[0028]
When the process of returning to step P2 and checking the presence / absence of the name is repeatedly executed, since the name C is drawn in the eighth area, the created record buffer 6 is cleared (step P3). Set the affiliation name C, number of hierarchies 2, display x, y coordinates of the eighth area in the created record buffer 6 (step P4), and check whether a lower link line is drawn from the eighth area to the lower area. (Step P5). In FIG. 6, since the lower link line is drawn from the eighth area to the thirteenth area, the affiliation name E of the link destination is set in the created record buffer 6 as lower affiliation information (step P6).
[0029]
Further, it is checked whether or not the upper link line is drawn from the eighth area to the upper area (step P7). In FIG. 6, since the upper link line is drawn from the eighth area to the upper second area, The name A of the link destination area is set in the created record buffer 6 as higher-level affiliation information (step P8). Then, a record having the same high-level affiliation and no record data set to the same affiliation yet is searched from the hierarchical memory of the drawing memory 5 (step P9), and the presence or absence of the record is determined (step P10).
[0030]
In FIG. 6, since the affiliation name with the same affiliation name A and the affiliation name A in the area to the right of the eighth area is not drawn, the record data set in the created record buffer 6 in step P12 is not drawn. (Affiliation name C, number of hierarchies 2, upper affiliation A, lower affiliation E, display x, y coordinates not shown) are set in the record memory 8 as shown in (3) in FIG. Is specified.
[0031]
When the process of checking the presence / absence of the name is repeated by returning to step P2, the created record buffer 6 is cleared because the name D is drawn in the eleventh area (step P3). The affiliation name D, the number of hierarchies 3 and the display x and y coordinates of the eleventh area are set in the created record buffer 6 (step P4), and it is checked whether or not the lower link line is drawn from the eleventh area to the lower area. (Step P5). In FIG. 6, since the lower link line is not drawn from the 11th area to the lower area, it is checked in step P7 whether or not the upper link line is drawn from the 11th area to the upper area.
[0032]
In FIG. 6, since the upper link line is drawn from the eleventh area to the upper sixth area, the name B of the link destination area is set in the created record buffer 6 as upper affiliation information (step P8). Then, a record having the same high-level affiliation and no record data set to the same affiliation yet is searched from the hierarchical memory of the drawing memory 5 (step P9), and the presence or absence of the record is determined (step P10).
[0033]
In FIG. 6, since the data of the number of hierarchies 3 having the same affiliation name B and higher affiliation as the eleventh area is not drawn, the record data (affiliation name) set in the created record buffer 6 in step P12 (D, number of hierarchies 3, upper affiliation B, display x, y coordinates not shown) are set in the record memory 8 as indicated by (4) in FIG. 9, and the next area is designated in step P13.
[0034]
When the process of returning to step P2 and checking the presence / absence of the name is repeated, the created record buffer 6 is cleared because the name E is drawn in the thirteenth area (step P3). The affiliation name E, the number of hierarchies 3, the display x and y coordinates of the 13th area are set in the created record buffer 6 (step P4), and it is checked whether or not a lower link line is drawn from the 13th area to the lower area. (Step P5). In FIG. 6, since the lower link line is not drawn from the thirteenth area to the lower area, it is checked in step P7 whether the upper link line is drawn from the thirteenth area to the upper area.
[0035]
In FIG. 6, since the upper link line is drawn from the thirteenth area to the upper eighth area, the name C of the link destination area is set in the created record buffer 6 as upper affiliation information (step P8). Then, a record having the same high-level affiliation and no record data set to the same affiliation yet is searched from the hierarchical memory of the drawing memory 5 (step P9), and the presence or absence of the record is determined (step P10).
[0036]
In FIG. 6, since the affiliation name of the hierarchy number 3 having the same affiliation name C and higher affiliation as in the thirteenth area is not drawn, the record data (affiliation) set in the created record buffer 6 in step P12 Name E, number of hierarchies 3, upper affiliation C, display x, y coordinates (not shown) are set in the record memory 8 as indicated by (5) in FIG. 9, and the next area is designated in step P13.
[0037]
If the process of checking the presence / absence of the name is repeated by returning to step P2, the name is not drawn in the 13th area shift, so the end of the memory area of the drawing memory 5 is confirmed in step P14 and the main affiliation is confirmed. The record setting process ends. Next, the affiliation record setting unit 7 executes the affiliation code setting process for each record data stored in the record memory 8 in the affiliation record setting process (step S4). This affiliation code setting process will be described based on the flowchart shown in FIG.
[0038]
First, the hierarchical code memory 9 is reset (step Q1), and the first record among the record data stored in the record memory 8, that is, the record (1) shown in FIG. 9 is designated (step Q2). The number of hierarchies 1 of the designated record is acquired (step Q3), and it is determined whether or not “0” is set in the code memory 9 corresponding to the hierarchy number 1 (step Q4). At this stage, since the code memory 9 for each layer with the number of layers 1 is “0”, the value of the upper layer is copied to the memory area (step Q5), and there is no layer higher than the number of layers 1 at this time. It remains “0”.
[0039]
Next, the interval value “10000” corresponding to the layer number 1 is added from the rule table 10 shown in FIG. 4 to the layer-level code memory 9 corresponding to the layer number 1 (0 + 10000) (step Q6), and the addition result Is set in the record memory 8 as the affiliation code of the designated record (step Q7). As a result, “10000” is set in the affiliation code column of the record with affiliation name A as shown in (1) of FIG. Next, it is checked whether or not the lower order affiliation is set in the designated record (step Q8). In FIG. 9, since B is set as the subordinate affiliation, the record of (2) in the figure with the subordinate affiliation B as the affiliation name is designated (step Q9), and the process returns to step Q3, and the number of hierarchies of the designated record 2 is acquired.
[0040]
Then, it is determined whether or not “0” is set in the layer-specific code memory 9 corresponding to the number of layers 2 (step Q4). At this stage, since the code memory 9 with the number of hierarchies 2 is “0”, the value of the upper hierarchy 1 is copied to the memory area (step Q5). At this time, the number of hierarchies 1 is set first. The value “10000” is copied to the memory area with the hierarchy number 2.
[0041]
Next, the interval value “1000” corresponding to the number of layers 2 is added from the rule table 10 shown in FIG. 4 to the layer-specific code memory 9 corresponding to the number of layers 2 (1000 + 10000) (step Q6), and the addition result Is set in the record memory 8 as the affiliation code of the designated record (step Q7). As a result, as shown in (2) in FIG. 11, “11000” is set in the affiliation code column of the record of affiliation name B.
[0042]
Next, it is checked whether or not the lower order affiliation is set in the designated record (step Q8). In FIG. 9, since D is set as the subordinate affiliation, the record of (4) in the figure with the subordinate affiliation D as the affiliation name is designated (step Q9), and the process returns to step Q3, and the number of hierarchies of the designated record Get 3.
[0043]
Then, it is determined whether or not “0” is set in the layer-specific code memory 9 corresponding to the number of layers 3 (step Q4). At this stage, since the code memory 9 with the number of hierarchies 3 is “0”, the value of the upper hierarchy 2 is copied to the memory area (step Q5). At this time, the number of hierarchies 2 is set first. The value “11000” is copied to the memory area of the number of hierarchies 3.
[0044]
Next, the interval value “100” corresponding to the number of layers 3 is added from the rule table 10 shown in FIG. 4 to the layer-specific code memory 9 corresponding to the number of layers 3 (100 + 11000) (step Q6), and the addition result Is set in the record memory 8 as the affiliation code of the designated record (step Q7). As a result, as shown in (3) in FIG. 11, “11100” is set in the affiliation code column of the record of affiliation name B. Next, it is checked whether or not the lower order affiliation is set in the designated record (step Q8). In FIG. 9, since no data is set in the subordinate affiliation of affiliation D, it is checked in step Q10 whether the peer affiliation is set. In FIG. 9, since the data is not set in the affiliation D of the affiliation D, the content “11100” of the code memory 9 classified by hierarchy corresponding to the number of hierarchies 3 is reset (step Q12).
[0045]
Next, the presence or absence of an unspecified record is checked (step Q13). Since the record (3) is not specified in FIG. 9, the record (3) is specified (step Q14), and the process returns to step Q3. Get the number of hierarchies 2 of the specified record.
[0046]
Then, it is determined whether or not “0” is set in the layer-specific code memory 9 corresponding to the number of layers 2 (step Q4). Since “11000” is set in the corresponding memory area by the code setting process for the record {circle over (2)}, the rule shown in FIG. 4 is stored in the hierarchical code memory 9 corresponding to the number of hierarchies 2 in step Q6. The interval value “1000” corresponding to the number of hierarchies 2 is added from the table 10 (1000 + 11000) (step Q6), and the addition result is set in the record memory 8 as the belonging code of the designated record (step Q7). As a result, as shown in (4) in FIG. 11, “12000” is set in the affiliation code column of the record of affiliation name C.
[0047]
Next, it is checked whether or not the subordinate affiliation is set in the designated record (step Q8). In FIG. 9, since E is set as the subordinate affiliation of affiliation C, the record of (5) in the figure having the subordinate affiliation E as the affiliation name is designated (step Q9), and the process returns to step Q3 and designated. Acquires the record hierarchy number 3.
[0048]
Then, it is determined whether or not “0” is set in the layer-specific code memory 9 corresponding to the number of layers 3 (step Q4). Since “0” is set in the corresponding memory area by the reset process, the value “12000” of the upper hierarchy is copied to the memory area of hierarchy 3 (step Q5). The interval value “100” corresponding to the number of hierarchies 3 is added from the rule table 10 shown in FIG. 4 to the hierarchical code memory 9 corresponding to (100 + 12000) (step Q6), and the addition result is assigned to the belonging record of the designated record Is set in the record memory 8 (step Q7). As a result, “12100” is set in the affiliation code column of the record with the affiliation name E, as indicated by (5) in FIG.
[0049]
Next, it is checked whether or not the lower order affiliation is set in the designated record (step Q8). In FIG. 9, since no data is set in the subordinate affiliation of affiliation E, it is checked in step Q10 whether the peer affiliation is set. In FIG. 9, since no data is set for the affiliation E of the affiliation E, the content “12100” of the layer-specific code memory 9 corresponding to the number of layers 3 is reset (step Q12).
[0050]
Next, the presence / absence of unspecified records is checked (step Q13). Since all record designations are completed and there are no undesignated records, the affiliation code designation process is terminated. At the end of the above-mentioned affiliation code setting process, the data stored in the layer-specific code memory 9 is “10000” for the number of layers 1 and “12000” for the number of layers 2 as shown in FIG.
[0051]
Returning to step S5 in FIG. 5 again, the upper, lower, and belonging names of each record set in the record memory 8 are replaced with code data, and stored in the belonging record file 11 (step S6). Finish the creation process.
[0052]
As described above, in the computer system 1 of the present embodiment, it is possible to automatically generate affiliation records for each name block included in the hierarchy diagram simply by drawing the hierarchy diagram, and each affiliation thereof. An identification code based on the analysis result of the hierarchical connection relationship for each name block can be automatically assigned to the record.
[0053]
As a result, when an organization is established or changed from an organization chart with a hierarchical structure, generation of a hierarchy record for each component of the changed organization chart and assignment of an identification code value to each component can be automated. In addition, it is possible to prevent data input errors due to manual input and reduce the work burden on the user.
[0054]
【The invention's effect】
According to the present invention, based on the displayed hierarchical diagram, the hierarchical connection relation information between the constituent elements of the hierarchical diagram and other constituent elements is analyzed, and a record is created for each constituent element. Since the affiliation code can be generated and assigned to each record, the affiliation code corresponding to the hierarchy chart can be automatically generated, and even if it is a complex organization chart, the affiliation code is entered manually. Compared to the above, not only can an input error be prevented, but an automatic affiliation code can be generated using the displayed hierarchy diagram.
[Brief description of the drawings]
FIG. 1 is a block diagram of a main part of a computer system to which the present invention is applied.
FIG. 2 is a diagram showing a memory configuration of the drawing memory in FIG. 1;
3 is a diagram showing a memory configuration in the hierarchical code memory of FIG. 1; FIG.
4 is a diagram showing an example of data set in the rule table of FIG. 1. FIG.
FIG. 5 is a flowchart of belonging file creation processing executed by the CPU of FIG. 1;
6 is a diagram showing an example of a hierarchy diagram drawn in the drawing memory of FIG. 1. FIG.
7 is a flowchart of affiliation record setting processing executed by the affiliation record creation unit 7 of FIG.
8 is a diagram showing a data configuration of record data set by the belonging record setting process of FIG.
9 is a diagram showing record data set for each name drawing area in FIG. 6 by the belonging record setting process in FIG. 7;
10 is a flowchart of an affiliate code setting process executed by the affiliate record creation unit 7 in FIG. 1;
11 is a diagram showing code data set for each name drawing area in FIG. 6 by the belonging code setting process in FIG. 10;
[Explanation of symbols]
1 Computer system
2 CPU
3 Input section
4 Hierarchy drawing editor
5 Drawing memory
6 Created record buffer
7 Affiliation record creation department
8 Record memory
9 Hierarchical code memory
10 Rule table
11 Affiliated record files
12 Display section
13 Bus

Claims (2)

Display means for displaying a hierarchical diagram in which a plurality of components are connected in a hierarchical connection structure;
A record that analyzes the hierarchy connection relation information between the constituent elements of the displayed hierarchy diagram and other constituent elements, and creates a record composed of the hierarchy in which the constituent element is located, the subordinate, and the peer affiliation information for each constituent element Creating means;
Tier storage means for preliminarily storing setting values corresponding to tiers;
The records corresponding to the respective constituent elements created by the record creating means are sequentially read out, and the set values corresponding to the hierarchies in the read records are read from the hierarchical storage means, and the set values are set for each record. Code generation means for generating different affiliation codes for lower affiliation information and peer affiliation information based on
A hierarchy diagram processing apparatus comprising: record generation means for assigning the affiliation code generated by the code generation means to the record. The code generation means includes code storage means for temporarily storing codes for each hierarchy, writes the read setting value as a code to the code storage means, and stores the code in the code storage means according to the read record hierarchy 2. The hierarchical diagram processing apparatus according to claim 1, wherein the codes are updated and generated as different affiliation codes.

Images