JPH08315038A - Hierarchical diagram preparing device - Google Patents

Abstract

PURPOSE: To provide a hierarchical diagram preparing device for preparing a hierarchical diagram to reduce a space part at the time of arranging plural constitutional elements in the same hierarchy in the case of plotting a graphic having hierarchical structure such as a company organization chart. CONSTITUTION: A CPU 2 allows an organization chart preparing processing part 7 to execute hierarchical table preparing processing and hierarchical, image developing processing at the time of executing organization chart display processing and prepare a hierarchical table based upon various data related to the organization which are stored in a belonging section table file 8a and an employee master file 8b in a file memory 8, develops the table in an image memory 9, and then displays the prepared organization hierarchical diagram on a display part 11. When rearrangement specification is instructed by key input operation through a key input part 3, an organization hierarchical diagram obtained by rearranging plural blocks in the same hierarchy so as to reduce a space part is displayed on the display part 11.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a hierarchical diagram creating apparatus for drawing a diagram having a hierarchical structure such as an organizational chart so as to create a blank diagram so as to reduce a blank portion of an output area of the diagram.

[0002]

2. Description of the Related Art Conventionally, when drawing a diagram having a hierarchical structure such as an in-house organizational chart, each department is based on the hierarchical relationship of the departments, members, etc., which are the constituent elements of the in-house organization, and the department unit. The organization chart is created by hierarchically arranging the members on a block-by-block basis and arranging the department blocks hierarchically so that the hierarchical relationship between the departments is clear. Further, in drawing this in-house organization chart, when there are a plurality of departments in the same hierarchy, the plurality of department blocks are arranged in parallel in the same hierarchy position.

The arrangement form of the constituent block when creating such a hierarchical diagram is similarly applied not only to the above-mentioned in-house organizational chart but also to the case where the constituent block of an organization having another hierarchical structure is arranged. .

[0004]

However, when a diagram having a hierarchical structure such as the conventional in-house organizational chart is drawn, if there are a plurality of components in the same hierarchy, the plurality of component blocks Since they were arranged in parallel at the same hierarchical position, a blank part was formed between the component blocks arranged in parallel, and the drawing area developed from the hierarchical diagram was not effectively used. There was a problem.

An object of the present invention is to create a hierarchy diagram so as to reduce a blank portion when arranging a plurality of components of the same hierarchy when drawing a diagram having a hierarchical structure such as an in-house organization chart. An object is to provide a drawing creation device.

[0006]

According to a first aspect of the present invention, there is provided a hierarchy diagram creating apparatus which is divided into a plurality of blocks, and hierarchy level information storage means for storing hierarchy level information for each block, and each of the blocks. Hierarchical connection information storage means for storing information indicating a hierarchical connection relationship with other blocks for each;
A hierarchical diagram creating means for creating a hierarchical diagram in which each of the blocks is expressed in a hierarchical relationship based on the hierarchical connection information and the hierarchical level information of each of the blocks. When arranging the blocks in the same layer based on the layer connection information and the layer level information, the blocks are sequentially arranged in a predetermined direction, and when the blocks in the lower layer with respect to one block are arranged in the upper layer, If there are multiple blocks to be placed below the placement position of the block that will be the hierarchy, and in the lower hierarchy,
When there is a vacant area in a direction opposite to the predetermined direction in the area of the lower hierarchy, the lower hierarchy blocks are arranged in a packed state in the direction of the vacant area. The hierarchical diagram creating apparatus according to the invention of claim 2 is
Hierarchical level information storage means that is divided into a plurality of blocks, and that stores, for each block, hierarchical level information of the block, and hierarchical connection that stores information indicating a hierarchical connection relationship between each block and other blocks. Information storage means,
A hierarchical diagram creating means for creating a hierarchical diagram in which each of the blocks is expressed in a hierarchical relationship based on the hierarchical connection information and the hierarchical level information of each of the blocks. When arranging the blocks in the same layer based on the layer connection information and the layer level information, the blocks are sequentially arranged in a predetermined direction, and when the blocks in the lower layer with respect to one block are arranged in the upper layer, If there are multiple blocks that are placed below the placement position of the block that forms the hierarchy and share the upper hierarchy, and each of these blocks is the end block on the hierarchy, then that block is placed on that hierarchy. It is characterized in that the upper position and the lower position are alternately displaced, and the blocks are arranged in a state opposite to the predetermined direction in a packed state. To have.

[0007]

According to the hierarchy diagram creating apparatus of the present invention, the hierarchy level information storage means is divided into a plurality of blocks, and the hierarchy level information is stored for each block, and another hierarchy level information storage means is provided for each block. A hierarchical connection information storage unit that stores information indicating a hierarchical connection relationship with a block, and a hierarchical diagram in which each block is expressed in a hierarchical relationship based on the hierarchical connection information and the hierarchical level information for each block. And a hierarchical diagram creating unit for creating the hierarchical diagram creating unit, wherein the hierarchical diagram creating unit sequentially arranges blocks in a predetermined direction when arranging the blocks in the same layer based on the hierarchical connection information and the hierarchical level information. In addition, when arranging a block of a lower layer with respect to one block, the block should be arranged below the position of the block that is the upper layer and should be arranged in the lower layer. If the click is more than one, in the region of its lower layer, wherein when the predetermined direction in which the free space in the opposite direction, are arranged in a state filled with the lower layer block in the direction of its free space.

Therefore, when drawing a diagram having a hierarchical structure such as an in-house organization chart, a plurality of components of the same hierarchy are rearranged in a state of being filled so as to reduce a blank portion to create a hierarchy diagram. Therefore, it is possible to effectively use the display area on the display screen when displaying the hierarchical diagram or the print area on the printing paper when printing.

According to the hierarchical diagram creating apparatus of the present invention, the hierarchy level information storing means is divided into a plurality of blocks, and the hierarchy level information of each block is stored, and each of the blocks. Each block is expressed in a hierarchical relationship based on the hierarchical connection information storage means that stores information indicating a hierarchical connection relationship with another block for each block, and the hierarchical connection information and the hierarchical level information for each block. And a hierarchy diagram creating means for creating a hierarchy diagram for creating a hierarchy diagram, wherein the hierarchy diagram creating means arranges the blocks in the same hierarchy based on the hierarchy connection information and the hierarchy level information in a predetermined direction. Will be placed one after another,
When arranging the blocks of the lower hierarchy with respect to one block, they are arranged below the arrangement position of the block to be the upper hierarchy, and there are a plurality of blocks having the same upper hierarchy in common. If the block is the end of the block, in the state that each block is staggered alternately in the position on the hierarchy and the position below it, and the block in the direction opposite to the predetermined direction. Place in a packed state.

Therefore, when a diagram having a hierarchical structure such as an in-house organization chart is drawn, a plurality of constituent elements in the same layer are rearranged alternately so as to reduce a blank portion to create a hierarchical diagram. It is possible to effectively use the display area on the display screen when displaying the hierarchical diagram or the print area on the printing paper when printing.

[0011]

Embodiments of the present invention will be described in detail below with reference to FIGS. 1 to 13 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 the essential parts of a computer system 1 of this embodiment.

In FIG. 1, the computer system 1 includes a CPU 2, a key input unit 3, a pointing device 4, a ROM 5, a RAM 6, an organization chart creation processing unit 7, a file memory 8, an image memory 9, a printing unit 10 and a display unit 11. And each unit is connected to the bus 12.

CPU (Central Processing Unit) 2
Controls various parts in the computer system 1 in accordance with various control programs stored in the ROM 5 to execute various information processes, and displays the processing steps and processing results thereof on the display part 1.
Display on 1. Further, the CPU 2 causes the organization chart creation processing unit 7 to execute the hierarchy table creation processing and the hierarchy image development processing in the organization chart display processing described later, and stored in the belonging table file 8a and the employee master file 8b in the file memory 8. After creating a hierarchy table based on various data related to the organization and expanding it in the image memory 9, the created organization hierarchy diagram is displayed on the display unit 11 and rearranged by a key input operation by the key input unit 3. When the designation is instructed, a rearrangement process 1 or a rearrangement process 2 to be described later is executed to display an organizational hierarchy chart in which a plurality of blocks in the same hierarchy are rearranged so that the blank portion is reduced in the display unit 11. Let

The key input unit 3 includes cursor keys, numeral input keys, various function keys, etc., and outputs a depression signal of the depressed key to the CPU 2. Pointing device 4
Is a pointing device that assists the input of the key input unit 3, and outputs an operation signal to the CPU 2.

A ROM (Read Only Memory) 5 is a CPU
2 stores various control programs to be executed, and also stores an organization chart display processing program and a hierarchy table creation processing program and hierarchy image expansion processing program executed by the organization chart creation processing unit 7 in the organization chart display processing, A rearrangement processing 1 program and a rearrangement processing 2 program which will be described later are stored. RAM (Random Accesss
Memory) 6 forms a memory area for expanding various data when the CPU 2 executes the various processing programs.

When the CPU 2 executes the organization chart display process, the organization chart creation processing unit 7 executes a hierarchy table creation process and a hierarchy image development process, which will be described later, to belong to the belonging table files 8a and 8a in the file memory 8. A hierarchy table is created based on various data related to the organization stored in the employee master file 8b, stored in the hierarchy table memory 7a, and hierarchy diagram image data is stored in the hierarchy table memory 7a. After being expanded in the image memory 9 using the counter 7b, the expanded organizational hierarchy diagram image is displayed on the display unit 11.

The file memory 8 stores an affiliation table file 8a and an employee master file 8b as shown in FIG. The affiliation table file 8a is a table for storing various pieces of information relating to the departments belonging to the organization as shown in FIG. 2 in association with the hierarchical structure of the organization.
Information such as an affiliation code, an affiliation name, a higher affiliation code (a higher affiliation department code to which the relevant affiliation department directly belongs), a hierarchical number (indicating a hierarchical position), and a chief employee number is stored in association with each other. Further, the employee master file 8b is a master file that stores various kinds of information relating to the employees of the department to which the employee belongs in the department table file 8a as shown in FIG. As information, information such as a job title, date of joining the company, age, and family is stored in association with each other.

The image memory 9 includes an organization chart creation processing unit 7
A memory area is formed in which the image data of the organizational processing chart created by is expanded in block units for each department. The printing unit 10 prints the print data input from the CPU 2 on a predetermined recording paper and outputs it, and the display unit 11 displays the CR data.
The display data is composed of a T (Cathode Ray Tube) or the like and displays the display data input from the CPU 2.

Next, the operation of this embodiment will be described. The organization chart display processing executed by the computer system 1 of the present embodiment will be described based on the flowchart shown in FIG. When the organization chart display processing is started in FIG. 4, first, the organization chart creation processing unit 7 creates a hierarchy table based on various data related to the organization stored in the belonging table file 8a and the employee master file 8b in the file memory 8. Is executed (step S1). This hierarchy table creation processing will be described based on the flowchart shown in FIG.

First, the first row of the hierarchical table shown in FIG. 6 to be expanded in the hierarchical table memory 7a is designated (step S101), and the belonging code having no higher-ranked belonging code is searched from the belonging table file 8a shown in FIG. , The retrieved belonging code is stored in the register SHO in the RAM 6 (step S
102). In the case of the belonging table file 8a shown in FIG.
Since the affiliation code 100 corresponds to an affiliation code without a higher affiliation code, this affiliation code 100 is registered in the register SHO.
Stored in.

Then, the hierarchy number "1" and the belonging name "Clock Division" of the belonging code 100 stored in the register SHO are read from the belonging table file 8a, and the respective read data are designated in step S101 in FIG. It is set in the first row of the hierarchy table shown (step S10).
3). Next, the employee master file 8b shown in FIG. 3 is referenced based on the corresponding employee number 0100 of the employee table file 8a, and the employee chief name “A” is assigned to the first row of the designated row of the hierarchical table of FIG. Set (Step S10
4).

Next, the second line which is the next line of the hierarchy table of FIG. 6 is designated (step S105), and the employee master file 8
It is checked whether or not there is another employee data belonging to the same group in b (step S106). If there is employee data belonging to the same department, the name of the relevant employee data is read from the employee master file 8b, set in the second row of the hierarchy table designated in step S105 (step S107), and the process returns to step S105.

If there is no employee data belonging to the same affiliation, there is no other employee data having the same affiliation code 100 in the employee master file 8b shown in FIG.
Assigned code 1 stored in register SHO in RAM6 by
An unsearched affiliation code having a higher affiliation of 00 is searched from the affiliation table file 8a (step S108), and it is determined whether there is a corresponding affiliation code based on the search result (step S109). If there is no corresponding affiliation code, the higher affiliation code of the affiliation code 100 stored in the register SHO in the RAM 6 is assigned to the affiliation table file 8
It is searched from a (step S110), and it is determined from the search result whether or not there is a corresponding affiliation code (step S111).

If there is no corresponding belonging code, this process is terminated, and if there is a corresponding belonging code, the searched belonging code is stored in the register SHO in the RAM 6 (step S112), and step S108 is executed. Return. Further, in step S109, when there is a corresponding belonging code, that is, the belonging table file 8a in FIG.
Then, affiliation code 1 with affiliation code 100 as the upper affiliation
Since 10 is on the second line, the corresponding affiliation code 110 is stored in the register SHO in the RAM 6 (step S1).
13) and returns to step S103.

Returning to step S103, step S11
The hierarchy number “2” and the organization name “development department” of the organization code 110 stored in the register SHO in 3 are read from the organization table file 8a, and the respective read data are designated as 2 in the hierarchy table of FIG. 6 specified in step S105. Set on the line. Next, the employee master file 8b of FIG. 3 is referred to based on the corresponding employee number 0501 of the employee table file 8a, and the employee chief name “B” is set to the second row of the designated row of the hierarchical table of FIG. (Step S104).
As a result, the data is expanded as shown in the second line of the hierarchy table of FIG.

Next, the third line which is the next line of the hierarchy table of FIG. 6 is designated (step S105), and the employee master file 8
It is checked whether or not there is another employee data of the same department 110 in b (step S106). Since there is no other employee data belonging to the same department 110 in the employee master file 8b in FIG. 3, the register S in the RAM 6 is stored in the step S113.
An unsearched affiliation code having the affiliation code 110 stored in the HO as a higher affiliation is searched from the affiliation table file 8a (step S108), and it is determined whether or not there is a corresponding affiliation code based on the search result (step S10).
9).

Since the affiliation table file 8a shown in FIG. 2 has an affiliation code 111 having a higher affiliation as the affiliation code 110, the affiliation code 111 is registered in the register S in the RAM 6.
Store in HO (step S113), step S10
Return to 3. Returning to step S103, step S113
The hierarchical number “3” and the organizational name “development section” of the affiliation code 111 stored in the register SHO at are read from the affiliation table file 8a, and the respective read data are designated in the three rows of the hierarchical table of FIG. 6 designated at step S105. Set on the eyes. Next, the employee master file 8b of FIG. 3 is referred to based on the corresponding employee number 1201 of the employee table file 8a, and the employee chief name “E” is set on the third line of the designated row of the hierarchical table of FIG. (Step S104). As a result, the data is expanded as shown in the third line of the hierarchical table of FIG.

Next, the fourth line, which is the next line of the hierarchy table of FIG. 6, is designated (step S105), and the employee master file 8
It is checked whether or not there is another employee data belonging to the same group in b (step S106). In the employee master file 8b of FIG. 3, the employee number 2 is stored as employee data of the same department 111.
Since there is 501, the name “I” of the corresponding employee data is set in the fourth line of the hierarchy table of FIG. 6 (step S10).
7) and returns to step S105.

Returning to step S105, the fifth line of the next line of the hierarchy table of FIG. 6 is designated and it is checked whether or not there is another employee data of the same department in the employee master file 8b (step S106). The employee master file 8b in FIG.
Since there is 502, the name “J” of the corresponding employee data is set in the fifth row of the hierarchy table of FIG. 6 (step S10).
7) and returns to step S105.

Returning to step S105, the sixth line of the next line of the hierarchy table of FIG. 6 is designated, and it is checked whether or not there is another employee data of the same department in the employee master file 8b (step S106). In the employee master file 8b of FIG. 3, the employee number 250 is stored as employee data of the same department 111.
No. 1 and 2502 exist, so that the affiliation code 11 stored in the register SHO in the RAM 6 in the above step S113
An unsearched affiliation code having a higher affiliation of 1 is searched from the affiliation table file 8a (step S108), and it is determined whether there is a corresponding affiliation code based on the search result (step S109).

Since the affiliation table file 8a of FIG. 2 has no affiliation code having the affiliation code 111 as a higher-level affiliation,
The higher affiliation code of the affiliation code 111 stored in the register SHO is searched from the affiliation table file 8a (step S110), and it is determined whether or not there is a corresponding affiliation code based on the search result (step S111). Since the affiliation code 110 exists as a higher-level affiliation code of the affiliation code 111, the affiliation code 110 is stored in the register SHO (step S112), and the process returns to step S108.

Then, steps S108 to S1.
When the belonging code 100 is stored in the register SHO by repeating the processing of 12, the steps S108 and S1 are performed.
In 09, the affiliation code 120 is searched from the affiliation table file 8a of FIG. 2 as an unsearched affiliation code having the affiliation code 100 as a higher affiliation, the affiliation code 120 is stored in the register SHO, and the process returns to step S103.

By repeating the above steps S103 to S107, the layer number "2" and the upper layer "1" are set as the data relating to the affiliation code 120 on the seventh and eighth lines in the hierarchical table of FIG. ", Department name" design department ", department chief name" C "and department member name" K "are developed.

Further, by repeatedly executing the above steps S103 to S113, each data on the ninth and subsequent rows in the hierarchical table of FIG. 6 is stored in the belonging table file 8a of FIG. 2 and the employee master file 8b of FIG. Then, the hierarchy table is created and the hierarchy table creation process ends.

When the hierarchical table creating process is completed, steps S1 to S2 in the hierarchical diagram display process of FIG.
Proceed to the hierarchical image development process of Regarding the hierarchical image expansion process executed by the organization chart creation processing unit 7, FIG.
It will be described based on the flowchart shown in FIG.

First, "1" is set to the horizontal counter m of the hierarchical number counter 7b used when setting the position where the hierarchical image is to be developed, and "0" is set to the vertical counter n (step S201). . Next, the top block of the hierarchy table of FIG. 6 is designated (step S202), and it is determined whether the hierarchy number of the designated block is larger than the numerical value set in the vertical counter n (step S20).
3).

In this case, since the layer number of the first block in the layer table of FIG. 6 is "1" and is larger than the numerical value "0" of the vertical counter n set in step S201, the layer number of the specified first block. 1 for vertical counter n
(Step S204). Then, the data expanded to the block corresponding to the designated hierarchy number 1 in the hierarchy table of FIG. 6 (affiliation name: clock division, chief name: A)
A block image is generated based on (step S20
5), the block image generated from the block with the layer number 1 is set at the development block position of the coordinate (1, 1) in the layer image development area as shown in FIG. 8 in the image memory 9 (step S206).

The hierarchical image development area shown in FIG. 8 in the image memory 9 has coordinates (m, n) corresponding to the count numbers counted by the vertical counter m and the horizontal counter n in the hierarchical number counter 7b. The hierarchical table data expansion area for each block shown is formed. As shown in FIG. 9, the inside of each block is a department name and four lines of data under the department name (first line: department chief name, second line-
4th line: Member name) is to be expanded.

In the block-based hierarchical table data expansion area of FIG. 8, block-unit data delimited by the hierarchical number of the hierarchical table of FIG. 6 is expanded. Next, it is checked whether or not upper layer data is set in the head block delimited by the layer number 1 in the designated layer table of FIG. 6 (step S207). Since the upper layer data is not set in the first block, the process proceeds to step S210, and the block of the next layer number of the first block in the layer table of FIG. 6 is designated to determine whether or not there is the next block. (Step S211). Since there is a block delimited by the layer number 2 next to the first block in the layer table of FIG. 6, the process returns to step S203.

In step S203, since the hierarchical number "2" of the designated next block is larger than the numerical value "1" set in the vertical counter n in the processing of step S204, the hierarchical number "2" of the designated block is set. The vertical counter n is set (step S204). Then, a block image is generated based on the data (affiliation name: development department, affiliation chief name: B) expanded in the hierarchy number 2 block of the hierarchy table in FIG. 6 (step S205), and the block image in the image memory 9 shown in FIG. In the hierarchical image development area as shown in, the layer number 2
The block image generated from the block is set (step S206).

Next, it is checked whether or not the upper hierarchy data is set in the hierarchy number 2 block of the specified hierarchy table of FIG. 6 (step S207). Since "1" is set as the upper layer data in the layer number 2 block of FIG. 6, the block position corresponding to the upper layer "1" is searched in the layer image of FIG. 8 (step S
208), the block image is combined with the retrieved upper layer block image and the line segment image as shown in FIG. 8 (step S209).

Next, the block next to the layer number 2 block in the layer table of FIG. 6 is designated (step S210), and it is determined whether or not there is a next block (step S21).
1). Since the hierarchy table of FIG. 6 includes blocks delimited by hierarchy number 3, the process returns to step S203.

In step S203, since the hierarchical number "3" of the designated next block is larger than the numerical value "2" set in the vertical counter n in the processing of step S204, the hierarchical number "3" of the designated block is set. The vertical counter n is set (step S204). Then, a block image is generated on the basis of the data (affiliation name: development section, affiliation manager name: E, affiliation member name: I, J) developed in the block of hierarchical number 3 (step S20).
5) The block image generated from the block with the layer number 3 is set at the block position of the coordinate (1, 3) in the layer image development area as shown in FIG. 8 in the image memory 9 (step S206).

Next, it is checked whether or not the upper hierarchy data is set in the hierarchy number 3 block of the specified hierarchy table of FIG. 6 (step S207). Since “2” is set as the upper layer data in the layer number 3 block of FIG. 6, the block position corresponding to the upper layer “2” is searched in the layer image of FIG. 8 (step S
208), the image of the searched upper layer block and the line segment image are combined with the image of the layer number 3 block as shown in FIG. 8 (step S209).

Next, the block next to the block having the layer number 3 in the layer table of FIG. 6 is designated (step S210), and it is determined whether or not there is a next block (step S21).
1). Since the hierarchy table of FIG. 6 includes blocks delimited by hierarchy number 2, the process returns to step S203.

In step S203, since the hierarchical number "2" of the designated next block is smaller than the numerical value "3" set in the vertical counter n in the processing of step S204, the horizontal counter m is counted up (m + 1).
→ m) to set m = 2 (step S212), and the layer number "2" of the designated block is set in the vertical counter n (step S204). Then, a block image is generated based on the data (affiliation name: design department, affiliation chief name: C, affiliation name: K) expanded in the block of the hierarchical number 2 (step S205), and the diagram in the image memory 9 is generated. In the hierarchical image development area as shown in 8, the block image generated from the hierarchical number 2 block is set at the block position of coordinates (2, 2) (step S2).
06).

Then, it is checked whether or not the upper hierarchy data is set in the hierarchy number 2 block of the specified hierarchy table of FIG. 6 (step S207). Since "1" is set as the upper layer data in the layer number 2 block of FIG. 6, the block position corresponding to the upper layer "1" is searched in the layer image of FIG. 8 (step S
208), the image of the searched upper layer block and the image of the line segment are combined into the layer number 2 block image as shown in FIG. 8 (step S209).

Next, the block next to the layer number 2 block in the layer table of FIG. 6 is designated (step S210), and it is determined whether or not there is a next block (step S21).
1). Since the hierarchy table of FIG. 6 includes blocks delimited by hierarchy number 2, the process returns to step S203.

In step S203, since the hierarchical number "2" of the designated next block is the same as the numerical value "2" set in the vertical counter n in the processing of step S204, the horizontal counter m is counted up ( m +
(1 → m) to set m = 3 (step S212), and the layer number “2” of the designated block is set in the vertical counter n (step S204). And the layer number 2
A block image is generated based on the data (affiliation name: sales department, affiliation chief name: D) developed in the block (step S205), and coordinates (in the hierarchical image development area as shown in FIG. The block image generated from the block having the layer number 2 is set at the block position of (3, 2) (step S206).

Then, it is checked whether or not the upper hierarchy data is set in the hierarchy number 2 block of the specified hierarchy table of FIG. 6 (step S207). Since "1" is set as the upper layer data in the layer number 2 block of FIG. 6, the block position corresponding to the upper layer "1" is searched in the layer image of FIG. 8 (step S
208), the image of the searched upper layer block and the image of the line segment are combined into the layer number 2 block image as shown in FIG. 8 (step S209).

Next, the block next to the block having the layer number 2 in the layer table of FIG. 6 is designated (step S210), and it is determined whether or not there is a next block (step S21).
1). Since the hierarchy table of FIG. 6 includes blocks delimited by hierarchy number 3, the process returns to step S203.

In step S203, since the hierarchical number "3" of the designated next block is larger than the numerical value "2" set in the vertical counter n in the processing of step S204, the hierarchical number "3" of the designated block is set. The vertical counter n is set (step S204). Then, a block image is generated on the basis of the data (affiliation name: first sales section, affiliation manager name: F, affiliation member name: L) developed in the block of the hierarchy number 3 (step S20).
5), the block image generated from the block with the layer number 3 is set at the block position of the coordinate (3, 3) in the layer image development area as shown in FIG. 8 in the image memory 9 (step S206).

Next, it is checked whether or not the upper hierarchy data is set in the hierarchy number 3 block of the specified hierarchy table of FIG. 6 (step S207). Since “2” is set as the upper layer data in the layer number 2 block in FIG. 6, the block position corresponding to the upper layer “2” is searched in the layer image in FIG. 8 (step S
208), the image of the searched upper layer block and the line segment image are combined with the image of the layer number 3 block as shown in FIG. 8 (step S209).

Next, the block next to the block having the layer number 3 in the layer table of FIG. 6 is designated (step S210), and it is determined whether or not there is a next block (step S21).
1). Since the hierarchy table of FIG. 6 includes blocks delimited by hierarchy number 3, the process returns to step S203.

In step S203, since the hierarchical number "3" of the designated next block is the same as the numerical value "3" set in the vertical counter n in the processing of step S204, the horizontal counter m is counted up ( m +
1 → m) to set m = 4 (step S212), and the hierarchical number “3” of the designated block is set in the vertical counter n (step S204). And the layer number 3
A block image is generated based on the data (affiliation name: second sales section, affiliation manager name: G, affiliation member name: M) developed in the block (step S205), and the image memory 9
In the hierarchical image development area as shown in FIG. 8, the block image generated from the hierarchical number 3 block is set at the block position of the coordinate (4, 3) (step S206).

Then, it is checked whether or not the upper hierarchy data is set in the hierarchy number 3 block of the specified hierarchy table of FIG. 6 (step S207). Since “2” is set as the upper layer data in the layer number 2 block in FIG. 6, the block position corresponding to the upper layer “2” is searched in the layer image in FIG. 8 (step S
208), the image of the searched upper layer block and the line segment image are combined with the image of the layer number 3 block as shown in FIG. 8 (step S209).

Next, the block next to the block with the layer number 3 in the layer table of FIG. 6 is designated (step S210), and it is determined whether or not there is a next block (step S21).
1). Since the hierarchy table of FIG. 6 includes blocks delimited by hierarchy number 3, the process returns to step S203.

In step S203, since the hierarchical number "3" of the designated next block is the same as the numerical value "3" set in the vertical counter n in the processing of step S204, the horizontal counter m is counted up ( m +
1 → m) to set m = 5 (step S212), and the layer number “3” of the designated block is set in the vertical counter n (step S204). And the layer number 3
A block image is generated based on the data (affiliation name: third sales section, affiliation manager name: H, affiliation member name: N) developed in the block (step S205), and the image memory 9
In the hierarchical image development area as shown in FIG. 8, the block image generated from the hierarchical number 3 block is set at the block position of coordinates (5, 3) (step S206).

Next, it is checked whether or not upper hierarchy data is set in the hierarchy number 3 block of the specified hierarchy table of FIG. 6 (step S207). Since “2” is set as the upper layer data in the layer number 2 block in FIG. 6, the block position corresponding to the upper layer “2” is searched in the layer image in FIG. 8 (step S
208), the image of the searched upper layer block and the line segment image are combined with the image of the layer number 3 block as shown in FIG. 8 (step S209).

Next, the block next to the block with the layer number 3 in the layer table of FIG. 6 is designated (step S210), and it is determined whether or not there is a next block (step S21).
1). Since there is no next block in the hierarchy table of FIG. 6, the hierarchy image expansion processing shown in FIG. 8 ends.

Then, in step S3 of FIG. 4, after displaying the organizational hierarchy image data expanded in the image memory 9 by the above-mentioned hierarchical image expansion processing on the display unit 11, the rearrangement designation is input from the key input unit 3. Confirm (step S4). When this rearrangement designation input designates the rearrangement process 1, the rearrangement process 1 is executed (step S5).

The rearrangement process 1 will be described with reference to the flowchart shown in FIG. First, in the hierarchical image of FIG. 8 expanded in the image memory 9,
The empty blocks in the lowest hierarchy are checked to determine whether there are empty blocks (steps S501 and S502). In the hierarchical image of FIG. 8, since there is an empty block at the block position (2, 3), the upper block (block position (3, 2)) of the drawing block (block position (3, 3)) on the right side of the empty block. Check whether or not includes a plurality of lower blocks (steps S503 and S504).

In the hierarchical image of FIG. 8, since the block of the upper hierarchy number 2 includes a plurality of blocks of the hierarchy number 3, the entire block of the plurality of lower hierarchy numbers 3 is shifted to the left by one block. (Step S505), the line segment connection between the plurality of shifted lower blocks and upper blocks is corrected (step S506).

Then, it is checked whether or not the position of the right end block of the lower block group in the m direction is equal to the position of the upper block in the m direction (steps S507 and S50).
8). If they are equal, another empty block in the lowest hierarchy is checked (step S509), and the process returns to step S502.

In this case, in the hierarchy image of FIG. 8, the rightmost block position of hierarchy number 3 shifted to the left and the hierarchy number 2
Since the right end block positions of are not equal, step S50
In step 8, it is determined that they are not equal to each other, and it is determined whether or not the shifted lower block area still has an empty area (step S510). Then, since there is no free area in the hierarchical image of FIG. 8, another empty block in the lowest hierarchy is checked (step S509), and the process returns to the determination processing of presence / absence of an empty block in step S502.

In the empty block check of the lowermost layer after the shift, there is no empty block, so that the process proceeds to step S511 and it is determined whether or not there is an empty column in the column direction. In the hierarchical image of FIG. 8, since there is no empty column on the left side in the column direction, this process ends. In addition, step S51
When it is determined that there is a vacant column in the column direction in 1, the entire block on the right side of the vacant column is shifted to the left by the number of vacant columns (step S512), and the line segment connecting the shifted blocks is corrected. Then (step S513), the present process ends.

If it is determined in step S510 that there is an empty area, the process returns to step S505 and the process of shifting the entire group of lower blocks to the left by one block is repeated, and in step S506.
The process of correcting the line segment connecting the shifted block and the upper block is repeatedly executed.

By executing the rearrangement 1 process described above, as shown in the display screen of the display unit 11 of FIG. 11, the hierarchical image of FIG. 8 shown in FIG. 8A is shown in FIG. As described above, the entire lowest hierarchical block is shifted to the left by the empty block, and the empty area of the drawing area between the blocks is reduced.

The rearrangement process 2 executed in step S6 when the rearrangement process 2 is designated in step S4 of FIG. 4 will be described with reference to the flowchart shown in FIG. For example, a case where the rearrangement process 2 is executed on the hierarchical image as shown in FIG. 13A will be described.

First, one block in the lowest hierarchy is designated (step S601), it is checked whether the upper block of the designated block includes a plurality of lower blocks (step S602), and a plurality of lower blocks are included from the check result. It is determined whether or not there is an upper block (step S60).
3). In the hierarchical image of FIG. 13A, since there are a plurality of (four) blocks of the layer number 2 which is the lowest layer with respect to the layer number 1, the group of the lower block is set to the lower layer of the even position block. The arrangement correction and the connecting line segments between the respective blocks are alternately corrected so as to become (step S604).

Next, another block in the lowest hierarchy is designated (step S605), and it is determined whether or not there is another block (step S606). If it is determined that there is another block, the process returns to step S602, the processes of steps S602 to S605 are repeatedly executed, and the alternating rearrangement process of the lowest hierarchy is repeatedly executed. If it is determined in step S606 that there is no other block in the lowest layer, this process ends.

By executing the rearrangement processing 2 described above, as shown in the display screen of the display unit 11 in FIG. 13, the hierarchical image shown in FIG. 13A becomes as shown in FIG. The odd blocks and the even blocks of the lowest hierarchical block are rearranged alternately to reduce the empty area of the drawing area between the blocks.

Therefore, in the computer system 1 of the present embodiment, when drawing a diagram having a hierarchical structure such as an in-house organization chart, a hierarchy is arranged so as to reduce a blank portion when arranging a plurality of components of the same hierarchy. Diagrams can be rearranged and created. As a result, the display area on the display screen when displaying on the display unit 11 or the print area on the printing paper when printing from the printing unit 10 can be effectively used.

[0074]

According to the hierarchical diagram creating apparatus of the first aspect of the present invention, when drawing a diagram having a hierarchical structure such as an in-house organizational chart, a plurality of constituent elements in the same hierarchical layer reduce a blank portion. Since a hierarchical diagram is created by rearranging the layers in such a manner, it is possible to effectively use the display area on the display screen when displaying the hierarchical diagram or the print area on the printing paper when printing. it can.

According to the hierarchical diagram creating apparatus of the second aspect of the invention, when drawing a diagram having a hierarchical structure such as an in-house organizational chart, a plurality of constituent elements of the same hierarchical layer are alternately arranged so as to reduce a blank portion. Since the hierarchical diagram is rearranged to create the hierarchical diagram, it is possible to effectively use the display area on the display screen when the hierarchical diagram is displayed or the print area on the printing paper when printing.

[Brief description of 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 an example of a data structure of a table stored in a affiliation table file of FIG.

3 is a diagram showing an example of a data structure of a master file stored in the employee master file of FIG.

FIG. 4 is a flowchart of an organization chart display process executed by the computer system of this embodiment.

5 is a flowchart of a hierarchy table creation process executed by the organization chart creation processing unit of FIG. 1 during the organization chart display process of FIG.

6 is a diagram showing an example of data stored in the hierarchy table memory of FIG. 1 by the hierarchy table creation processing of FIG.

7 is a flowchart of a hierarchical image expansion process executed by the organizational chart creation processing unit in FIG. 1 during the organizational chart display processing in FIG.

8 is a diagram showing a block image of the hierarchy table expanded in the image memory of FIG. 1 by the hierarchy image expansion processing of FIG.

9 is a diagram showing the contents of hierarchical data expanded in block units within the hierarchical image expansion area of FIG.

FIG. 10 is a rearrangement process 1 executed by the CPU of FIG.
Flow chart.

11 is a diagram showing a state where the hierarchical image of FIG. 8 is rearranged by the rearrangement processing 1 of FIG.

12 is a rearrangement process 2 executed by the CPU of FIG.
Flow chart.

13 is a diagram showing a state in which a predetermined hierarchical image is rearranged by rearrangement processing 2 in FIG.

[Explanation of symbols]

 1 Computer System 2 CPU 3 Key Input Section 4 Pointing Device 5 ROM 6 RAM 7 Organization Chart Creation Processing Section 7a Hierarchical Table Memory 7b Hierarchy Number Counter 8 File Memory 9 Image Memory 10 Printing Section 11 Display Section 12 Bus

Claims (2)

[Claims] 1. A hierarchy level information storage unit which is divided into a plurality of blocks and which stores hierarchy level information for each block, and a hierarchy which stores information indicating a hierarchical connection relationship between each block and other blocks. Connection information storage means, and hierarchy diagram creation means for creating a hierarchy diagram in which each block is expressed in a hierarchical relationship based on the hierarchy connection information and the hierarchy level information for each block, When arranging the blocks of the same hierarchy based on the hierarchy connection information and the hierarchy level information, the hierarchy diagram creating means sequentially arranges the blocks in a predetermined direction and also arranges blocks of lower hierarchy with respect to one block. In this case, the block should be placed below the block placement position of the upper layer, and if there are multiple blocks to be placed in the lower layer, the area of the lower layer. In the case the predetermined direction in which the free space in the opposite direction, hierarchical diagram drawing device being characterized in that to arrange in a state filled with the lower layer block in the direction of its free space. 2. Hierarchical level information storage means, which is divided into a plurality of blocks, stores hierarchical level information of each block, and information indicating a hierarchical connection relationship between each block and other blocks. A hierarchical connection information storage unit that stores the hierarchical connection information storage unit and a hierarchical diagram creation unit that creates a hierarchical diagram in which each block is expressed in a hierarchical relationship based on the hierarchical connection information and the hierarchical level information for each block. When the blocks of the same layer are arranged based on the layer connection information and the layer level information, the hierarchy diagram creating unit sequentially arranges the blocks in a predetermined direction and also lower layers of one block. When arranging a block, place it below the block placement position of the upper layer, and there are multiple blocks that share the upper layer. If the block is the end block on the hierarchy, the respective blocks are alternately displaced between the position on the hierarchy and the position on the lower side, and the direction opposite to the predetermined direction. A hierarchical diagram creating apparatus characterized in that the respective blocks are arranged in a packed state.