JP2007233728A - Graph figure arrangement method, program, and device - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a graph figure arrangement method capable of preventing the crossing of arcs and the overlapping of nodes and drawing an easy-to-see graph figure. <P>SOLUTION: The graph figure arrangement section 4 takes out a graph figure from a graph data storage section 7 for storing a graph figure, comprising a plurality of nodes, and an arc defined as a line for connecting the nodes in a connection relationship in the nodes, as data, and determines the arrangement of each node non-hierarchically for arranging a graph figure, based on the setting target value of the distance between nodes calculated from a calculation expression correlated with the size of a node connected to each node at both the ends of the arc. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to an arrangement method of graph figures, and more particularly to a graph figure arrangement method for arranging graph figures in a non-hierarchical manner, a program for causing a computer to function as a graph figure arrangement unit for arranging graph figures according to this method, and an apparatus therefor It is.

  A lot of researches have been made on graph graphic layout methods to reveal the hierarchy, and various algorithms have been proposed. On the other hand, there has not been much research on the placement of non-hierarchical graph figures, and an algorithm that automatically places the nodes of the graph figure as points without considering the size of the nodes included in the graph figure is proposed. It has only been done. For example, in the algorithm disclosed in Non-Patent Document 1, a node included in a graph figure is considered as a point, a simple spring force is defined between the nodes, and an ideal distance between the nodes is determined as a graph theoretical distance, That is, a graph figure is automatically drawn as the number of arcs that form the shortest path between nodes.

  In Patent Document 1, a set target value for the distance between nodes is calculated from a set target value calculation formula for the distance between nodes defined as an increasing function for the number of arcs connected to the nodes at both ends of the arc. Then, by determining the arrangement of the nodes in a non-hierarchical manner based on the set target value, it is possible to arrange graph figures with uniform node sizes in a balanced manner.

T. KAMADA and S. KAWAI, “An algorithm for drawing general undirected graphs”, Information Processing Letters, Vol. 31, NO.1 (1989), pp. 7-15. Japanese Patent No. 3346130

  In the conventional non-hierarchical method of arranging graph figures, the size of nodes is not taken into consideration when arranging graph figures including nodes having a certain size. For this reason, when the graph figure is arranged, there is a problem that the nodes are overlapped to make the graph figure difficult to see.

  In Japanese Patent Laid-Open No. 2004-228688, graph figures with uniform node sizes can be arranged with good balance, but graph figures with varying node sizes cannot be drawn with good balance.

  The present invention has been made to solve the above-described problems, and by arranging the graph graphic according to the characteristics of the graph graphic structure and the size of the node, it is possible to prevent arc crossing and node overlap. It is an object of the present invention to provide a graph graphic arrangement method capable of realizing easy-to-view graph graphic drawing, a program for causing a computer to function as a graph graphic arrangement unit for arranging graphic figures according to this method, and an apparatus therefor.

  The present invention also provides a graph graphic arrangement method that arranges a graph graphic according to the characteristics of the graph graphic structure and the size of the node and can interactively edit the graph graphic, and a graph that arranges the graphic graphic according to this method. It is an object of the present invention to obtain a program and a device for causing a computer to function as a graphic layout unit.

  In the graph graphic arrangement method according to the present invention, the graph graphic arrangement unit stores, as data, a graph graphic composed of a plurality of nodes and arcs defined as lines connecting nodes connected to each other among these nodes. The graph figure is taken out from the graph data storage unit, and the placement of each node is determined based on the set target value of the distance between the nodes calculated from the calculation formula correlated with the size of the node connected to each node at both ends of the arc. The graphic figure is arranged by non-hierarchical determination.

  According to the present invention, the arrangement of each node is determined non-hierarchically based on the set target value of the distance between nodes calculated from a calculation formula correlated with the size of the node connected to each node at both ends of the arc. Therefore, there is an effect that it is possible to realize easy-to-see graph graphics with few arc crossings and node overlaps.

Embodiment 1 FIG.
FIG. 1 is a block diagram showing a configuration of a graph figure arrangement apparatus according to Embodiment 1 of the present invention. The graph graphic arrangement device according to the first embodiment includes an input device 1, a processing device 2, and an output device 8. Further, the processing device 2 includes a management unit 3, a graph graphic arrangement unit 4, a graph graphic editing unit 5, a graph graphic drawing unit 6, and a graph data storage unit 7. The device on the input device 1 side and the device on the output device 8 side may share a single CRT, LCD, keyboard, hard disk, etc., and display the input data and the arrangement of graph figures in a multi-window format. It is also free.

  The management unit 3 manages the processing of the entire processing device 2. That is, the management unit 3 moves the process to the graph graphic editing unit 5 in accordance with the editing request from the input device 1 and causes the graph graphic editing unit 5 to edit the graph graphic. When the processing of the graph graphic editing unit 5 ends, the management unit 3 stores the result in the graph data storage unit 7 and moves the processing to the graph graphic drawing unit 6. The graph graphic drawing unit 6 draws a graph graphic on the output device 8 according to the data in the graph data storage unit 7.

  Further, the management unit 3 moves the processing to the graph graphic placement unit 4 in accordance with the graph graphic automatic placement request from the input device 1 and causes the graph graphic placement unit 4 to determine the placement of the graph graphic. The management unit 3 causes the graph data storage unit 7 to store the arrangement result by the graph graphic arrangement unit 4, and then moves the processing to the graph graphic drawing unit 6. The graph figure drawing unit 6 draws a graph figure on the output device 8 according to the data in the graph data storage unit 7.

  The graph graphic arrangement unit 4 includes means for automatically rearranging the arrangement of the graph graphic based on the data in the graph data storage unit 7 according to the instruction of the management unit 3. In the first embodiment, the graph graphic is arranged so that the actual distance between the nodes is as close as possible to a predetermined ideal distance (set target value) between the nodes as a graph graphic arrangement method.

  Specifically, for each connected component of the graph figure, an ideal distance between nodes when arranged on a plane is determined, and an appropriate function value is set to the square of the error between the ideal distance between nodes and the actual distance. An arrangement method is used in which the nodes are moved little by little so that the sum of all multiplied nodes becomes as small as possible. However, the multiple branches and self-cycles in the graph are removed as preprocessing, and the multiple branches and self-cycles removed in the preprocessing are restored as post-processing to draw a graph figure.

  In the present invention, when calculating the ideal distance between nodes, as will be described later, a calculation formula including a parameter related to the size of the node is used. Thereby, even when a graph figure including nodes having a certain size is arranged, the nodes can be arranged so that there is less overlap between the nodes.

  The graph graphic editing unit 5 includes processing means for editing the graph graphic in accordance with instructions from the management unit 3. Editing contents include addition, deletion and movement of nodes, addition and deletion of arcs, and the like, and the arrangement of graph figures can be enlarged or reduced around an appropriate node or an appropriate coordinate.

  In addition, the graph graphic drawing unit 6 includes means for drawing a graph graphic on the output device 8 based on the data in the graph data storage unit 7 in accordance with the instruction of the management unit 3. The graph data storage unit 7 includes means for storing data such as the size and position of each element together with the structure of the graph. For example, it is embodied by a hard disk mounted on the processing device 2 or a drive device for reproducing a storage medium.

  The management unit 3, the graph graphic arrangement unit 4, the graph graphic editing unit 5, the graph graphic drawing unit 6, and the graph data storage unit 7, for example, execute a processing program according to the gist of the present invention on a computer constituting the processing device 2. By executing the arithmetic processing unit and controlling its operation, it can be realized as a specific means in which software and hardware cooperate.

Next, the graph figure arrangement process according to the first embodiment will be described.
As described above, in the first embodiment, for each connected component of the graph, the ideal distance between nodes when arranged on a plane is determined, and the square of the difference between the ideal distance between nodes and the actual distance is determined. Multiplied by an appropriate function value (a function representing the correlation between the target distance setting value between nodes and the corresponding actual distance between nodes) so that the total of all nodes is as small as possible. Move it little by little. At this time, the multiple branches and self-cycles in the graph figure are removed as pre-processing, and the multiple branches and self-cycles removed in the pre-processing are restored as post-processing to draw the graph figure.

FIG. 2 is a flowchart showing a flow of processing for removing multiple branches and self-cycles in a graph figure by the graph figure processing apparatus according to the first embodiment, which will be described with reference to FIG. 1 and FIG.
First, the graph graphic arrangement unit 4 reads the data of the graph graphic from the graph data storage unit 7 under the control of the management unit 3 and sets multiple branches from the graph graphic, that is, a set of arcs having the same two nodes as both ends. Is searched (step ST1). As a method of this search, a method of comparing the nodes at both ends of all the pairs that simply select two different arcs can be considered.

  When the graph graphic placement unit 4 starts the search in step ST1, the graph graphic placement unit 4 shifts to a process of determining the presence or absence of an arc pair having both ends of the same two nodes (step ST2). At this time, when a set of arcs having the same two nodes at both ends is found, the graph graphic placement unit 4 performs a process of removing either arc from the set of arcs (step ST3).

  On the other hand, if a pair of arcs having the same two nodes at both ends is not found, the graph graphic placement unit 4 searches the graph graphic for an arc that forms a self-closed loop, that is, an arc that is one node with the same both ends ( Step ST4). As a search method, it is conceivable to compare nodes at both ends of all arcs.

  The graph figure arrangement | positioning part 4 will transfer to the process which determines the presence or absence of the arc which is one node where both ends are the same, if the search by step ST4 is started (step ST5). At this time, when an arc that is one node having the same both ends is found, the graph graphic arrangement unit 4 executes a process of removing the arc (step ST6). Also, if not found, the process is terminated.

  Note that the Euclidean distance is used as the distance used in this embodiment, but the same argument can be made by using other distances such as a Hamming distance. The dimension of the coordinate system for drawing the graph figure may be two-dimensional or three-dimensional, and generally n-dimensional (n = 1, 2, 3, 4,...).

Next, a process for calculating an ideal distance between nodes will be described.
First, an ideal distance e _ij on the graph figure between the nodes i and j at both ends of the arc a _ij is set in the graph figure arrangement unit 4 as shown in the following formula (1) depending on the state of the node i and the node j. Defined. However, in the following formula (1), α is a scaling constant serving as a reference for the length between nodes. N _i is a set of nodes adjacent to the node i, and N _j is a set of nodes adjacent to the node j. R _m is the radius of the node m and is m⊂N _i or m⊂N _j . Dividing the first term on the right side by 2 means that the average is taken for node i and node j.

From the above equation (1), the ideal distance on the graph between the nodes i and j at both ends of the arc a _ij becomes longer as the sum of the radii of the nodes connected to the nodes i and j increases. That is, the ideal distance e _ij between the nodes i and j is an increasing function of the sum of the radii of the nodes connected to the nodes i and j according to the above equation (1).

  In addition, the definition of the ideal distance (setting target value) between the nodes i and j in the present invention is not limited to the relationship represented by the above formula (1). For example, the ideal distance between nodes connected by one arc is a numerical value that correlates with the radius of a node adjacent to each node at both ends of the arc (for example, the size of the node such as the sum of the node radii). Defined by a function that tends to increase. Any calculation formula for a function that meets this definition can be freely set according to the purpose.

The ideal distance of the arc a _ij is the value of e _ij defined by the above equation (1), and the ideal distance between the non-adjacent nodes m and n that are not connected by one arc is the node m, The total length of the ideal distances of arcs constituting the path between n is assumed. Thereby, in arrangement | positioning of a graph figure, it can prevent making the node which should be arrange | positioned far away approach unreasonably.

  In the graph arrangement algorithm according to the first embodiment, the graph figure is arranged so that the arc length is as ideal as possible, so that the arc length is determined by the state of the nodes at both ends thereof. Can do. When the definition of the arc length is the above formula (1), a graph figure including a node having a large radius and a node having a high degree can be arranged in an easily viewable manner.

Further, the graph graphic arrangement unit 4 uses, as an evaluation function, the square of the difference between the ideal distance between nodes and the actual distance between nodes (the ideal distance between the nodes and the corresponding distance between the actual nodes). A sum E for all nodes of the graph figure to be arranged is defined as the following equation (2).
However, in the following formula (2), N is a set of all nodes of the graph figure, and i and j are N elements (where j ≠ i). K _ij is a spring constant between the nodes i and j, and corresponds to the contribution ratio of the correlation between the ideal distance between the nodes i and j and the actual distance between the nodes i and j with respect to the value of the evaluation function E. To do. E _ij is an ideal distance (set target value) on the graph figure between the node i and the node j, and d _ij is a distance between the nodes i and j.

  As described above, in the non-hierarchical automatic placement method of graph figures according to the first embodiment, the ideal distance on the placement plane between the nodes is calculated by a calculation formula (for example, the above formula (1)) according to the purpose. Then, the nodes are moved little by little so that the value of the evaluation function E, which takes the above formula (2) as an example, becomes small to some extent, and the layout of the graph figure is obtained. The evaluation function E represented by the above formula (2) regulates the occurrence of interaction between the nodes as a result in the graph figure arrangement method according to the present embodiment. That is, if this E is made as small as possible, it is possible to realize an arrangement in which the interaction between the nodes is small, for example, there is no overlap between the nodes.

There are various methods for obtaining a node arrangement that makes the evaluation function E as small as possible. For example, a case will be described in which a simulated annealing method, which is well known as a method for obtaining an optimization problem solution or approximate solution, is used.
In the graph figure arrangement unit 4, the following formula (3) in which E in the formula (2) is calculated only for the node i is defined.

Graph figure placement unit 4, when the arrangement of the graph figure data read from the graph data storage unit 7, a E _i according to the aforementioned formula (3) was calculated for all nodes in the graph figure, the value of E _i of the calculation result For the largest node i, the position of the node i is slightly moved, and an operation for obtaining an approximate solution of the simulated annealing method using the above equation (2) as an objective function is applied once. Thereafter, the graph graphic arrangement unit 4 recalculates E _i for all the nodes and repeats the operation of obtaining an approximate solution for the node having the largest E _i among the calculation results in the same manner as described above. Find the arrangement of nodes that is as small as possible.

但し、Ｋ₁，Ｋ₂は適当な定数である。ｔ_ijはノードｉ，ｊにおいてグラフ図形の構造を考慮して定義される値であり、ノードｉ，ｊが隣接する場合は下記式（５）によって計算される。ここで、ｎ_iはノードｉの次数（ノードｉに隣接するアークの数）である。また、隣接しないノードｉ，ｊ間については、ｔ_ijとしてノードｉ，ｊを結ぶ最短パスを構成するアークの両端のノードｍ，ｎのｔ_mnの合計の長さとする。

By defining an appropriate calculation formula as k _{ij in the} above formula (2), an error in E as the ideal distance between nodes i and j increases (the correlation between the ideal distance e _ij and the actual distance d _ij is obtained). (Function value to be expressed) can be reduced in relative size, and it can be reduced that nodes are too close to each other and overlap. As a result, it is possible to place a locally balanced graph figure while considering the balance of the entire graph figure. In the graph figure arrangement unit 4 according to the first embodiment, k _ij is defined by the following formula (4). Formula (4), the node i for the evaluation function value, actual node i to the ideal distance e _ij between j, k _ij corresponding to the contribution of the correlation between the j distance d _ij is the actual node i, This is defined by a decreasing function that decreases with respect to the distance j _ij between j and the ideal distance e _ij between the nodes i and j.

However, K ₁ and K ₂ are appropriate constants. t _ij is a value defined in consideration of the structure of the graph figure at the nodes i and j. When the nodes i and j are adjacent to each other, it is calculated by the following equation (5). Here, n _i is the degree of node i (the number of arcs adjacent to node i). Further, between nodes i and j that are not adjacent, t _ij is the total length of t _mn of nodes m and n at both ends of the arc constituting the shortest path connecting nodes i and j.

In the present invention, the definition of k _ij is not limited to the form of the above formula (4), but between adjacent nodes, a function having a correlation with the size of the node connected to the node, connected to the node Any one of a function correlated with the number of arcs to be performed or a function correlated with the ideal distance between nodes can be freely set according to the purpose.

  According to the above equation (5), the relative magnitude of the error in E can be reduced as the distance of the graph theoretically increases as the shortest path includes a higher-order node, and the balance of the entire graph figure is reduced. In consideration of the above, it is possible to arrange the graph figures in a locally balanced manner.

Next, details of the graph graphic arrangement processing by the graph graphic arrangement unit 4 will be described.
FIG. 3 is a flowchart showing the flow of graph graphic arrangement by the graph graphic arrangement unit of the first embodiment, and will be described with reference to this figure and FIG.
First, the graph graphic arrangement unit 4 takes out graph graphic data from the graph data storage unit 7 (step ST1a). Then, the graph figure arrangement | positioning part 4 performs the process after step ST2a for every connected component in a graph figure. In step ST2a, the graph graphic arrangement unit 4 searches for and removes multiple branches and self-cycles from the graph graphic data in the flow shown in FIG.

  When executing the processing of step ST2a for a certain connected component, the graph figure arrangement unit 4 initializes the value of the count which is a loop counter to 0 (step ST3a). After that, the graph figure arrangement unit 4 uses an equation that tends to increase with respect to the radius of the node adjacent to each node at both ends of the arc, for example, the above equation (1), and the ideal distance between the nodes. Is calculated (step ST4a).

  When the ideal distance between the nodes is calculated, the graph figure placement unit 4 sets, for example, the value of the evaluation function E defined by the above equation (2) is smaller than a preset reference value or the count value is set. The end of the graph graphic automatic placement algorithm is determined depending on whether or not one of the conditions is satisfied (step ST5a). Here, if it is determined that any of the above conditions is satisfied and the placement of the graph figure is determined, the graph figure placement unit 4 is a graph obtained by restoring the multiple branches and self-cycles from which the placed graphic figure data is removed. The data is stored as data in the graph data storage unit 7 (step ST6a).

  On the other hand, if none of the above conditions is satisfied, the graph graphic placement unit 4 increases the value of count by 1 (step ST7a), and changes the position of the node so that the value of the evaluation function E according to the above equation (2) becomes small. Change (step ST8a). Further, the graph graphic arrangement unit 4 has a sequential drawing flag for setting whether or not to sequentially draw the graphic figure whose arrangement has been determined. Depending on whether this sequential drawing flag is on or off, a node is set in step ST8a. It is determined whether or not the moved graph figure is sequentially drawn (step ST9a).

  If the sequential drawing flag is on in step ST9a, the graph figure arrangement unit 4 determines whether the count value satisfies the drawing condition (step ST10a). For example, a value C indicating how many times the loop based on the value of the count is performed is drawn in advance as a value for determining the ratio of successive drawing. When the value of count is divisible by C, the graph graphic arrangement unit 4 determines that the drawing condition is satisfied, and proceeds to the drawing process in step ST11a. If the count value is not divisible by C, it is determined that the drawing condition is not satisfied, and the process returns to step ST5a.

  When it is determined in step ST10a that the drawing conditions are satisfied, the graph graphic arrangement unit 4 stores the data of the graph graphic in which the node position is changed in step ST8a in the graph data storage unit 7. Thereafter, the management unit 3 outputs the graph graphic data to the graph graphic drawing unit 6. As a result, the graph graphic drawing unit 6 erases the currently displayed graph graphic on the display device such as the LCD constituting the output device 8, and instead displays the graph graphic in which the position of the node is changed in step ST8a. To do. By doing in this way, the change of the graph figure by the graph graphic automatic arrangement process can be continuously displayed with an appropriate progress.

Next, the graph graphic editing process will be described.
FIG. 4 is a flowchart showing the flow of the graph graphic editing process by the graph graphic arrangement apparatus according to the first embodiment, which will be described with reference to FIG. 1 and FIG.
In editing a graph figure, the processing device 2 is first waiting for input of a command or data related to graph figure editing by a pointing device such as a mouse constituting the input device 1 (step ST1b). Here, when a command or data is input using the input device 1, the command or data is output to the management unit 3 via the graph graphic arrangement unit 4.

  In the management unit 3, it is determined whether or not the input command or data is related to the editing of the graph figure (step ST2b). If it is determined that the graph graphic is not related to editing, the process proceeds to step ST3b. If the graphic graphic is related to editing, the process proceeds to step ST5b.

  In step ST3b, the management unit 3 determines whether or not the input command or data is related to the graph drawing automatic drawing process. If it is determined that the graph graphic is not related to automatic drawing, the process proceeds to step ST4b. If the graphic graphic is related to automatic drawing, the process proceeds to step ST6b.

  In step ST4b, the management unit 3 determines whether or not the input command is a process end command. If the command is an end command, the process ends. If the command is not an end command, it is determined that the command or data is related to processing other than graph graphic editing processing and graph graphic automatic drawing processing, the processing is executed, and then the process returns to step ST1b to execute the command or data. Waiting for input.

  If the management unit 3 determines in step ST2b that the input command or data is related to graph graphic editing, the management unit 3 outputs the command or data to the graph graphic editing unit 5. The graph graphic editing unit 5 executes graph graphic editing processing in accordance with the command or data input from the management unit 3 (step ST5b). Editing contents include movement, deletion and enlargement / reduction of nodes, addition / deletion of arcs, and the like, and it is also possible to enlarge or reduce the arrangement of graph figures centering on appropriate nodes or appropriate coordinates.

  If the management unit 3 determines in step ST3b that the input command or data is related to the automatic drawing process of the graph graphic, the management unit 3 outputs the command or data to the graph graphic arrangement unit 4. The graph graphic arrangement unit 4 executes the graphic graphic arrangement process according to the command or data input from the management unit 3 according to the flow shown in FIG. 3, and the graph data storage unit stores the determined graphic graphic data. 7 Thereafter, the graph graphic drawing unit 6 reads the graph graphic data to be automatically drawn from the graph data storage unit 7 and displays it on the display device of the output device 8 (step ST6b).

  FIG. 5 is a diagram showing a drawing example of a graph figure. FIG. 5A shows a case where a graph figure is drawn without applying this embodiment, and FIG. 5B shows a case where FIG. The drawing example at the time of applying the graph figure arrangement | positioning method by this Embodiment with respect to the graph figure which has the same component as is shown. The graph figure shown in FIG. 5 includes a node represented by a circle having a small radius and a node having a certain size represented by a circle having a larger radius than this node. For this reason, if the size of a node is not taken into consideration, when graph figures are arranged, for example, large nodes are arranged overlapping each other.

The example of FIG. 5A is a drawing example when the user inputs the graph figure as described above using the graph figure editor, and the user draws as he / she thinks. This arrangement is not easy to see, and there is an overlap between nodes.
On the other hand, in the graph figure arrangement method according to the first embodiment, for example, an increasing tendency correlated with the radius of the node adjacent to each node at both ends of the arc as defined by the above formula (1). Is used to calculate the ideal distance between the nodes, and the placement position is set so that the value of the evaluation function E regarding the occurrence of the interaction between the nodes as defined by the above formula (2) becomes smaller. decide. Thereby, the arrangement of graph figures without arc crossing or node overlap is realized. Therefore, as shown in FIG. 5B, the drawing is easier to see in each stage than in FIG.

  FIG. 6 is a diagram showing another example of drawing a graph figure. FIG. 6A is a drawing example of a graph figure in which a plurality of nodes including nodes having a certain size are arranged on the circumference and connected by an arc. FIG. 6B shows a drawing example when the graph graphic arrangement method according to the present embodiment is applied to a graph graphic having the same components as FIG. As shown in FIG. 6 (a), when a plurality of nodes are arranged and connected by arcs, there are a large number of arc crossings and overlapping of nodes, which makes it difficult to understand the connection relationship between nodes. Drawing results are difficult to see.

  Therefore, when the graph graphic arrangement method according to the first embodiment is applied to this graph graphic, nodes such as overlaps are considered in consideration of the size of the node using the above formula (1), the above formula (2), and the like. The components of the graph figure are arranged so that the interaction between them becomes as small as possible. Accordingly, in the example shown in FIG. 6B, the graph figure having the same configuration as that in FIG. 6A includes a connection structure in which small diameter nodes are connected radially from, for example, each node of eight large diameter circles. Is obtained. As is clear from the comparison with FIG. 6A, there is no overlap between the nodes, and the drawing result is very easy to see with almost no arc crossing.

  As described above, according to the first embodiment, the graph graphic placement unit 4 places a graph graphic composed of a plurality of nodes and an arc defined as a line connecting nodes having a connection relationship. , Using a calculation formula that correlates with the size of the node connected to each node at both ends of the arc in the graph figure, in particular, a calculation formula that tends to increase with respect to the size of the node connected to each node at both ends of the arc. The target setting value for the distance between nodes is calculated, and the placement of each node is determined non-hierarchically based on the calculated target setting value for the distance between nodes, so the graph figure is placed according to the size of the node. Thus, arc crossing and node overlap can be prevented, and easy-to-view graph graphics can be drawn.

  Further, according to the first embodiment, when the graph graphic arrangement unit 4 arranges the graph graphic, two nodes connected via a plurality of arcs are removed from the graph graphic as multiple branches, and the inter-nodes are connected. Since the set target value is calculated with respect to the distance, the components of the graph figure are arranged in a balanced manner as a whole, and the drawing of the graph figure that is easy to see can be realized.

  Further, according to the first embodiment, the graph graphic placement unit 4 has a function value representing the correlation between the set target value of the distance between nodes and the corresponding actual distance between nodes in the graph graphic to be placed. The sum of all nodes is defined as an evaluation function, and the node arrangement is changed sequentially so that the value of this evaluation function becomes smaller on the plane arrangement, so the graph figure is arranged according to the characteristics of the graph figure structure. It is possible to realize easy-to-see graph drawing.

Furthermore, according to the first embodiment, the contribution rate k _ij of the correlation between the ideal distance e _ij between the nodes i and j and the actual distance d _ij between the nodes i and j with respect to the value of the evaluation function E is expressed by the node Since the function tends to decrease with respect to either the ideal distance e _ij between i and j or the corresponding distance d _ij between the actual nodes i and j, the ideal distance e _ij between the nodes i and j increases as the distance increases. The relative magnitude of a function value (for example, an error between the ideal distance e _ij and the actual distance d _ij ) representing the correlation between the ideal distance e _ij and the actual distance d _{ij in} the value of the evaluation function E It is possible to reduce the size, and it is possible to reduce the overlap between nodes that are too close to each other.

Embodiment 2. FIG.
In the second embodiment, the force acting between nodes is defined based on the difference between the set target value of the distance between nodes and the corresponding actual distance between nodes, and the force acting between the nodes to be placed in the graphic layout. The node arrangement is sequentially changed so that is balanced on the plane arrangement.
The graph graphic arrangement device according to the second embodiment has the same basic configuration as that of the first embodiment, but the graphic graphic arrangement processing is performed using the force acting between the nodes by the graph graphic arrangement unit 4 as a determination parameter for the arrangement position. It differs in that it is made.

Next, details of the graph graphic arrangement processing according to the second embodiment will be described.
Similarly to the first embodiment, the graph graphic arrangement unit 4 includes processing means for automatically arranging the graph graphic so that it can be easily seen. In the graph graphic arrangement unit 4 according to the second embodiment, the force acting between the nodes is defined, and the graph graphic arrangement is obtained in a state where the forces acting between the nodes are balanced as much as possible.

On the other hand, in the graph graphic arrangement unit 4 of the second embodiment, an ideal distance e _ij on the graph graphic between the nodes i and j at both ends of the arc a _ij is defined as the following equation (6). However, in the following formula (6), α is a scaling constant serving as a reference for the length between nodes. N _i is a set of nodes adjacent to the node i. R _m is the radius of the node m and is _m ⊂N _i or _m ⊂N _j . Dividing the first term on the right side by 2 means that the average is taken for node i and node j. P is a constant for keeping the ideal distance between nodes below a certain value.

From the above equation (6), the ideal length of the arc is an increasing function of the node radius R _m . That is, according to the above equation (6), the ideal distance e _ij between the nodes i and j tends to become longer as a node with a larger radius is connected to the nodes i and j.
The present invention is not limited to the case where the ideal distance between the nodes i and j is obtained by the above equation (6), but the ideal distance between the nodes connected by one arc is the state of the node. It is sufficient that the calculation formula of the function is determined by the above, and it can be freely set according to the purpose.

The ideal distance e _ij defined by the above equation (6) is the ideal length of the arc a _ij , and the ideal distance between non-adjacent nodes m and n that are not connected by one arc is the nodes m and n. It is defined as the total length of the ideal distance of the arcs that make up the path between. Thereby, in arrangement | positioning of a graph figure, it can prevent making the node which should be arrange | positioned far away approach unreasonably.

  In the graph figure placement unit 4 in which the graph placement algorithm according to the second embodiment is set, the graph is placed so that the distance between the nodes is as ideal as possible between the nodes. For this reason, according to the definition of the ideal distance between nodes, the distance between nodes can be determined by the structure of a graph figure. For example, when the definition of the distance between the nodes is the above equation (6), it is possible to arrange a graph figure including a node with a high degree in an easy-to-see manner.

Further, the graph figure arrangement unit 4 corresponds to the difference between the ideal distance e _ij between the nodes i and j and the actual distance d _ij between the nodes i and j (corresponding to the ideal distance of the distance between the nodes) as an evaluation function. A function obtained by multiplying an appropriate function value by a function representing a correlation with an actual distance between nodes is defined as the following formula (7) as a force F _ij acting between the nodes i and j. However, in the following equation _{(7), f (I ij} ) is always appropriate function that takes a positive value, the node i to the value of the evaluation function F _ij, the actual node and the ideal distance e _ij between j i, This corresponds to the contribution ratio of the correlation with the distance d _ij between j. I _ij is a graph theoretical distance between nodes i and j. e _ij is an ideal distance on the graph figure between the nodes i and j, and d _ij is an actual distance between the nodes i and j on the graph figure.

The second term (d _ij −e _ij ) on the right side of the above equation (7) takes a negative value when the distance between the nodes i and j is smaller than the ideal distance between the nodes i and j. , Takes a positive value when the distance between nodes i and j is greater than the ideal distance between nodes i and j. Here, since the function f> 0, the force defined by the above equation (7) becomes a repulsive force when the distance between the nodes i and j is smaller than the ideal distance between the nodes i and j, and the force between the nodes i and j When the distance is larger than the ideal distance between the nodes i and j, it becomes an attractive force.

In the above description, an appropriate function that always takes a positive value is selected as the function f (I _ij ). However, a function that takes a negative value within a very small range may be used. Also, by defining an appropriate function as f (I _ij ) in the above equation (7), the force F acting between the nodes can be reduced as the graph theoretical distance between the nodes increases. Thereby, it is possible to perform the graph graphic arrangement in which the forces F acting between the local nodes are balanced while considering the balance of the forces F acting between the nodes in the entire graph graphics.

Further, a function f (I _ij ) representing a graph theoretical distance between nodes is defined in the graph figure arrangement unit 4 as shown in the following formula (8). Here, K ₃ and K ₄ are appropriate positive constants. d _ij is an actual distance between the nodes i and j on the graph figure.

According to the above equation (8), the function f (I _ij ) becomes a decreasing function for the distance d _ij between the nodes i and j when the relationship d _ij <R _i + R _j is satisfied, and the nodes are too close to each other. Can be prevented. When d _ij ≧ R _i + R _j , the function f (I _ij ) is a decreasing function for the graph theoretical distance I _ij between the nodes, and as the graph theoretical distance between the nodes increases, Force acting between nodes relative to the magnitude of the error between the actual distance between nodes and the ideal distance between nodes (a function value representing the correlation between the actual distance between nodes and the ideal distance between nodes) Can be reduced. Thereby, it is possible to perform the graph graphic arrangement in which the forces F acting between the local nodes are balanced while considering the balance of the forces F acting between the nodes in the entire graph graphics.

  Note that the present invention is not limited to the above formulas (7) and (8) as the definition of the force between the nodes, and the magnitude of the force is reduced to an appropriate level as the graph theoretical distance between the nodes increases. Any function that seems to be in a declining trend. As described above, in the graph graphic arrangement method of the second embodiment, the node arrangement is sequentially changed so that the forces acting between the nodes defined by the above equation (7) are in an equilibrium state.

Next, graph graphic layout processing by the graph graphic layout unit 4 will be described.
FIG. 7 is a flowchart showing a flow of graph graphic arrangement by the graph graphic arrangement unit of the second embodiment, and will be described with reference to this figure and FIG.
First, the graph graphic placement unit 4 takes out graph graphic data from the graph data storage unit 7 (step ST1c). Subsequently, the graph graphic arrangement unit 4 performs the processing after step ST2c for each connected component in the graph graphic. In step ST2c, the graph graphic placement unit 4 searches for and removes multiple branches and self-cycles from the graph graphic data in the flow described with reference to FIG. 2 in the first embodiment.

  When executing the process of step ST2c for a certain connected component, the graph figure arranging unit 4 initializes the value of the count which is a loop counter to 0 (step ST3c). Thereafter, the graph figure placement unit 4 uses, for example, a calculation formula of a function for determining an ideal distance between nodes connected by one arc as in the above formula (6) according to the state of the node. Is calculated (step ST4c).

When the ideal distance between the nodes is calculated, the graph figure placement unit 4 has a value of the force F _ij acting between the nodes i and j defined by the above formula (7), for example, smaller than a preset reference value. Alternatively, the end of the graph graphic automatic placement algorithm is determined depending on whether or not the condition of whether the count value is greater than the set value is satisfied (step ST5c). If it is determined that any of the above conditions is satisfied and the placement of the graph figure is determined, the graph figure placement unit 4 stores the placement-determined graph figure data in the graph data storage unit 7 (step ST6c). .

  On the other hand, when none of the above conditions is satisfied, the graph graphic placement unit 4 increases the value of count by 1 (step ST7c), and sets the position of the node so that the value of the evaluation function F according to the above equation (7) becomes small. Change (step ST8c). Further, the graph graphic arrangement unit 4 has a sequential drawing flag for setting whether or not to sequentially draw the graphic figure whose arrangement has been determined. Depending on whether this sequential drawing flag is on or off, a node is set in step ST8c. It is determined whether or not the moved graph figure is sequentially drawn (step ST9c).

  If the sequential drawing flag is on in step ST9c, the graph figure placement unit 4 determines whether the value of count satisfies the drawing condition (step ST10c). For example, a value C indicating how many times the loop based on the value of the count is performed is drawn in advance as a value for determining the ratio of successive drawing. When the value of count is divisible by C, the graph graphic arrangement unit 4 determines that the drawing condition is satisfied, and proceeds to the drawing process in step ST11c. If the count value is not divisible by C, it is determined that the drawing condition is not satisfied, and the process returns to step ST5c.

  When it is determined in step ST10c that the drawing conditions are satisfied, the graph graphic arrangement unit 4 stores the data of the graph graphic in which the node position is changed in step ST8c in the graph data storage unit 7. Thereafter, the management unit 3 outputs the graph graphic data to the graph graphic drawing unit 6. As a result, the graph graphic drawing unit 6 erases the currently displayed graph graphic on the display device such as an LCD constituting the output device 8, and displays the graph graphic in which the position of the node is changed instead in step ST8c. To do. By doing in this way, the change of the graph figure by the graph graphic automatic arrangement process can be continuously displayed with an appropriate progress.

  FIG. 8 to FIG. 10 are diagrams showing examples of drawing a graph figure that has been subjected to the graphic figure arrangement process according to the second embodiment. The graph figure shown in FIG. 8 is composed of a node represented by two small-diameter circles (hereinafter referred to as a small-diameter node) and a node represented by one large-diameter circle (hereinafter referred to as a large-diameter node). Contains as an element. In the present embodiment, the nodes are arranged so that the forces acting between the nodes are in an equilibrium state. In the example shown in FIG. 8, since the force acting between the large diameter node and the small diameter node is in an equilibrium state, the arc lengths between the large diameter node and the two small diameter nodes are substantially equal. That is, it is possible to eliminate the difficulty in viewing that may occur when the irregular arrangement is made such that the distance from the large-diameter node differs between two small-diameter nodes having the same size.

  Moreover, the graph figure shown in FIG. 9 includes two small diameter nodes and two large diameter nodes as components. Also in the example of FIG. 9, the force acting between the nodes is arranged in an equilibrium state. By arranging in this way, as shown in FIG. 9, for example, when connecting between one small-diameter node and two large-diameter nodes, arcs connecting one small-diameter node and two large-diameter nodes respectively. The arrangement is approximately equal in length. In addition, the small-diameter nodes are arranged symmetrically with respect to the arc between the large-diameter nodes. Thereby, it is possible to realize easy-to-see graph drawing.

  The graph figure shown in FIG. 10 includes three small diameter nodes and one large diameter node as components. Also in the example of FIG. 10, the force acting between the nodes is arranged in an equilibrium state. By arranging in this way, as shown in FIG. 10, for example, the lengths of the arcs connected to the large diameter node between the three small diameter nodes are substantially equal. Further, with respect to the small-diameter nodes connected to each other, the small-diameter nodes having no connection other than the large-diameter nodes are arranged without being biased to any of the small-diameter nodes via the large-diameter nodes. As a result, it is possible to prevent node overlap caused by variations in arc length and the like, and it is possible to realize easy-to-see graph drawing.

  As described above, according to the second embodiment, the graph graphic placement unit 4 applies the force acting between the nodes based on the difference between the set target value of the distance between the nodes and the corresponding actual distance between the nodes. It is possible to place a graph figure according to the characteristics of the graph figure structure by defining and sequentially changing the node arrangement so that the force acting between the nodes subject to figure arrangement is balanced on the plane arrangement And easy-to-read graphs can be obtained.

  Further, according to the second embodiment, the contribution ratio of the correlation between the set target value of the distance between nodes with respect to the value of the evaluation function F and the corresponding actual distance between nodes is set as the set target value of the distance between nodes. Alternatively, since the function that tends to decrease with respect to the graph theoretical distance between nodes or the distance between nodes is used as the evaluation function, locality is considered while considering the balance of the force F acting between the nodes in the entire graph figure. It is possible to perform graph graphic arrangement in which the force F acting between the nodes is balanced.

Furthermore, according to the second embodiment, the evaluation function F _ij of nodes for values i, actual node i to the ideal distance e _ij between j, the contribution rate of the correlation between the distance d _ij between j f (I _ij ) Is a function that tends to decrease with respect to either the actual distance d _ij between the nodes i and j or the distance I _ij in the graph theory between the nodes i and j. As the distance I _ij increases, the function value _indicating the correlation between the ideal distance e _ij and the actual distance d _ij occupying the value of the evaluation function F _ij (for example, between the ideal distance e _ij and the actual distance d _ij The relative magnitude of (error) can be reduced, and it is possible to reduce the overlap between nodes that are too close to each other.

Embodiment 3 FIG.
In the third embodiment, the connection structure of the network device to be monitored is drawn and edited as a graph graphic by applying the graph graphic arrangement method according to the first and second embodiments to the network device monitoring apparatus. .

  FIG. 11 is a block diagram showing a configuration of a graph figure arrangement apparatus according to Embodiment 3 of the present invention, and shows a case where the present invention is applied to a network equipment monitoring apparatus. The graph / graphic arrangement device according to the third embodiment includes an input device 9, a network device monitoring device 10, and an output device 11. The device on the input device 9 side and the device on the output device 11 side may share a single CRT, LCD, keyboard, hard disk, etc., and display the input data and the arrangement of graph figures in a multi-window format. It is also free.

  The network device monitoring apparatus 10 includes a system management unit 12, a network device data management unit 13, a network device data output unit 14, a network device data processing unit 15, a network device data storage unit 16, a graph editor management unit 17, a graph figure. An editing unit 18, a graph graphic arrangement unit 19, a graph graphic output unit 20, a graph data extraction unit 21, and a graph data storage unit 22 are provided. For example, the network device monitoring apparatus 10 is provided with a function of drawing and editing a connection structure of network devices on a network as a graph figure to a conventional network device monitoring device that monitors the state of the network device.

  The system management unit 12 outputs management information according to the information input via the input device 9 to the network device data management unit 13 or the graph editor management unit 17, and the network device data management unit 13 or the graph editor management unit 17 Manage the process.

  The network device data management unit 13 moves the process to the network device data processing unit 15 or moves the process to the network device data output unit 14 according to the management information from the system management unit 12. Further, the network device data output unit 14 outputs to the output device 11 based on the network device data from the network device data storage unit 16 according to the information (control information) from the network device data management unit 13.

  The network device data processing unit 15 performs various operations such as changing the connection relationship between network devices for the network device data stored in the network device data storage unit 16 in accordance with information (control information) from the network device data management unit 13. Process. The network device data storage unit 16 includes means for storing network device data, and stores and reads network device data. For example, it is embodied by a hard disk mounted on the network device monitoring apparatus 10 or a drive device that reproduces a storage medium. The network device data includes a symbol image corresponding to the network device, data defining a connection structure between the network devices, and the like.

  The graph editor management unit 17 moves the processing to the graph graphic editing unit 18, the graph graphic arrangement unit 19, the graph graphic output unit 20, or the graph data extraction unit 21 according to the management information from the system management unit 12. The graph graphic editing unit 18 includes means for editing the graph graphic in accordance with information (control information) from the graph editor management unit 17. The editing contents are node addition, deletion and movement, arc addition and deletion, and the like.

The graph graphic placement unit 19 includes means for placing a graph graphic in accordance with information (control information) from the graph editor management unit 17. As the means for arranging the graph figure, the method for arranging the graph figure as described in the first embodiment so that the distance between the actual nodes is as close as possible to the predetermined ideal distance between the nodes, As described in the second embodiment, the force acting between the nodes is defined based on the difference between the set target value of the distance between the nodes and the corresponding actual distance between the nodes. It is possible to arrange graph figures by arranging them so that the working forces are balanced on the plane arrangement. In the third embodiment, a function f (I _ij ) described later is defined in the graph graphic layout method according to the second embodiment.

  The graph graphic output unit 20 outputs the graph graphic data stored in the graph data storage unit 22 to the output device 11 in accordance with information (control information) from the graph editor management unit 17. The graph data extraction unit 21 reads information defining the connection structure of network devices on the network from the network device data stored in the network device data storage unit 16 according to the information (control information) from the graph editor management unit 17. Extracted as graph graphic data. The graph data storage unit 22 includes means for storing graph graphic data, and stores and reads graph graphic data according to information (control information) from the graph editor management unit 17. For example, it is embodied by a hard disk mounted on the network device monitoring apparatus 10 or a drive device that reproduces a storage medium.

  In addition, the system management unit 12, the network device data management unit 13, the network device data management unit 13, the network device data output unit 14, the network device data processing unit 15, the network device data storage unit 16, the graph editor management unit 17, the graph figure The editing unit 18, the graph graphic arrangement unit 19, the graph graphic output unit 20, the graph data extraction unit 21, and the graph data storage unit 22 are, for example, a processing program according to the gist of the present invention. By executing the arithmetic processing unit and controlling its operation, it can be realized as a specific means in which software and hardware cooperate.

Next, the operation will be described.
FIG. 12 is a flowchart showing the flow of graph graphic layout editing processing by the graph graphic layout device of the third embodiment, which will be described with reference to FIG.
In editing a graph figure, the network device monitoring apparatus 10 is first waiting for input of a command or data related to graph figure editing by a pointing device such as a mouse constituting the input device 9 (step ST1d).

  Thereafter, when a command or data is input using the input device 9, the system management unit 12 determines whether the input command or data is for processing network device data (step ST2d). . If it is determined that the network device data is not processed, the process proceeds to step ST3d. If the network device data is processed, the process proceeds to step ST7d.

  In step ST <b> 3 d, the system management unit 12 determines whether or not the input command or data is related to graph graphic processing. If it is determined that the processing is not related to graph graphic processing, the process proceeds to step ST14b. If it is related to graph graphic processing, the processing proceeds to step ST4d.

  When the input command or data is related to the processing of the graph graphic, the system management unit 12 determines whether or not the command or data is related to the automatic arrangement of the graph graphic (step ST4d). At this time, if it is determined that the graph graphic is not related to automatic arrangement, the process proceeds to step ST5d, and if it is related to automatic graphic graphic arrangement, the process proceeds to step ST11d.

  In step ST5d, when the input command or data is not related to the automatic arrangement of the graph graphic, the system management unit 12 determines whether or not the command or data is related to the graphic graphic editing. At this time, if it is determined that the graph graphic is not related to editing, the process proceeds to step ST6d, and if it is related to graph graphic editing, the process proceeds to step ST8d.

  In step ST6d, the system management unit 12 determines that the input command or data is related to the processing of the graph graphic, and is intended to perform processing other than the layout and editing of the graph graphic. The data is output to the graph editor management unit 17. As a result, the graph editor management unit 17 causes any one of the configuration units 18 to 22 that perform operation management to execute graph graphic processing other than automatic graphic graphic placement and graph graphic editing. For example, the sequential drawing flag is turned on / off. After this process, the process returns to step ST1d again and shifts to a command or data input waiting state.

  If the system management unit 12 determines in step ST2d that the input command or data is related to processing of network device data, the system management unit 12 outputs the command or data to the network device data management unit 13.

  The network device data management unit 13 manages network device data processing according to the command or data input from the system management unit 12. The contents of this process may include creation and deletion of a link representing connection between network devices, addition of a network device, and the like. If the instruction from the system management unit 12 is the above processing content, the network device data management unit 13 causes the network device data processing unit 15 to execute the above processing (step ST7d).

  For example, the network device data processing unit 15 creates a link representing the connection between the network devices for the network device data read from the network device data storage unit 16 in accordance with the command or data input from the network device data management unit 13. Or the existing link is deleted and stored in the network device data storage unit 16.

  If the system management unit 12 determines in step ST5d that the input command or data is related to graph graphic editing, the system management unit 12 outputs the command or data to the graph editor management unit 17.

  The graph editor management unit 17 manages graph graphic editing processing in accordance with commands or data input from the system management unit 12. As the editing contents, addition, deletion and movement of nodes, addition and deletion of arcs, and the like can be considered. In this case, the graph editor management unit 17 causes the graph graphic editing unit 18 to execute the editing process in accordance with an instruction from the system management unit 12 (step ST8d).

  The graph graphic editing unit 18 operates on the graph graphic data read from the graph data storage unit 22 according to the command or data input from the graph editor management unit 17 in the same flow as in FIG. 4 described in the first embodiment. An editing process is performed and stored in the graph data storage unit 22.

  On the other hand, in step ST9d, the graph editor management unit 17 edits the network device data in step ST7d according to the command or data input from the system management unit 12, and the sequential drawing flag is on. It is determined whether or not. If the network device data has not been edited or the sequential drawing flag is off, the process returns to step ST1d again and shifts to a command or data input waiting state.

  When the network device data is edited and the sequential drawing flag is on, the graph editor management unit 17 controls the graph data extraction unit 21 from the network device data storage unit 16 to the network device data processing unit 15. The information about the network device image and its connection structure in the network device data edited by the above is extracted.

  The graph data extraction unit 21 stores the extracted image of the network device and information related to the connection structure in the graph data storage unit 22 as graph graphic data. As a result, the graph graphic arrangement unit 19 reads the graph graphic data stored in the graph data storage unit 22 by the graph data extraction unit 21 and executes the graph graphic arrangement processing in the same manner as in the first and second embodiments. Then, it is stored again in the graph data storage unit 22. There are several graph graphic placement methods executed by the graph graphic placement unit 19 as shown in the first and second embodiments, and an arbitrary number of placement methods may be prepared as necessary.

In the third embodiment, the graph graphic arrangement unit 19 uses the graph graphic arrangement method shown in the second embodiment in which f (I _ij ) of the above formula (8) is expressed by the following formula (9). To do. Here, K ₅ is an appropriate positive constant. Further, e _ij is an ideal distance on the graph figure between the nodes i and j, and I _ij is a graph theoretical distance between the nodes i and j.

Thus, as (e _ij + I _ij ) increases, f (I _ij ) decreases, and the magnitude of error between the actual distance between nodes and the ideal distance between nodes increases as the graph theoretical distance between nodes increases. In contrast, the force acting between the nodes can be reduced. Therefore, it is possible to arrange the graph figures in which the balance of the forces acting between the local nodes is balanced while considering the balance of the forces acting between all the nodes of the graph figures.

  Next, the graph graphic output unit 20 reads out the graph graphic data determined by the graph graphic arrangement unit 19 from the graph data storage unit 22 according to the instruction of the graph editor management unit 17, and configures the LCD constituting the output device 11. And so on (step ST10d). Thereafter, the process returns to step ST1d again and shifts to a command or data input waiting state.

  In step ST4d, when the system management unit 12 determines that the input command or data is related to the automatic layout of the graph graphic, the input command or data is output to the graph editor management unit 17. The graph editor managing unit 17 controls the graph figure arranging unit 19 according to the command or data input from the system managing unit 12 to execute the graph figure arranging process (step ST11d).

  For example, when the command input from the system management unit 12 is an arrangement instruction command for a specific graph graphic, the graph graphic arrangement unit 19 displays the corresponding graph graphic data as a graph data storage unit 22. The graph graphic layout processing is performed in the same manner as in step ST10d, and is again stored in the graph data storage unit 22.

  In addition, when the graph graphic editing unit 18 edits the graph graphic in step ST12d, the graph editor management unit 17 determines whether or not the sequential drawing flag is on. Here, if the sequential drawing flag is on, the graph editor management unit 17 controls the graph graphic placement unit 19 to read the graph graphic data edited by the graph graphic editing unit 18 from the graph data storage unit 22. In the same manner as in step ST10d, the graph graphic layout processing is performed and stored again in the graph data storage unit 22.

  In this way, the graphic data determined by the graphic graphic arrangement unit 19 is read out to the graphic graphic output unit 20 under the control of the graph editor management unit 17 and displayed on the LCD or the like constituting the output device 11. It is drawn on the screen of the device. Note that after this drawing process or when the sequential drawing flag is OFF in step ST12d, the process returns to step ST1d again and shifts to a command or data input waiting state.

  In step ST14d, the system management unit 12 determines whether the input command or data is related to the end process. Here, if the input command is an end command and relates to an end process, the process ends. On the other hand, if the input command or data is not related to the termination process, the system management unit 12 is not related to the processing of the network device data and the processing of the graph graphic. It determines with it being related to processes other than these, and performs the operation | movement regarding the said other process to other components not shown (step ST13d). After this process, the process returns to step ST1d again and shifts to a command or data input waiting state.

  FIG. 13 and FIG. 14 are diagrams illustrating examples of graph graphic drawing of a network device that has been subjected to graph graphic arrangement processing according to the third embodiment. The graph diagram of the network device shown in FIG. 13 is a node (hereinafter referred to as a PC) consisting of 11 personal computer symbol images having the same size, and a node consisting of the symbol images of three servers having a size larger than the PC (hereinafter referred to as PC). The component includes a PC (hereinafter referred to as a server) and a node (hereinafter referred to as a router) composed of symbol images of two routers smaller in size than the PC and the server. Also in this embodiment, similarly to the second embodiment, the nodes are arranged so that the forces acting between the nodes are in an equilibrium state.

  The forces acting on each connection between the router and the 11 PCs are in an equilibrium state, and the node size of each PC is substantially the same. Thus, in the example shown in FIG. 13, the length of each arc between the router and the PC is substantially equal, and includes an arrangement in which 11 PCs are connected radially and point-symmetrically around the router. By arranging in this way, it is possible to prevent routers and PCs from overlapping and arcs to be crossed compared to the case where the distance from the router varies from PC to PC, and it is possible to draw graph figures that are easy to see at each stage. it can.

  Further, the forces acting on each connection between the router and the three servers are in an equilibrium state, and the node sizes of the servers are substantially the same. By arranging in this way, as shown in FIG. 13, the arc length corresponding to each connection between the router and the three servers becomes equal. That is, it is possible to eliminate the difficulty in viewing the graph figure due to the difference in the distance from the router for each server.

  The graph diagram of the network device shown in FIG. 14 includes nine PCs that are nodes of the same symbol image, three servers that are symbol images that are nodes of a symbol image larger than the PC, and the PC and server. Two routers that are symbol images corresponding to a node having a smaller size, a hub that is a node of a symbol image that is larger than the router and smaller than a PC, and a node that is a symbol image of the same size as a PC It is included as a component.

  In the example shown in FIG. 14, the force acting on the connection between the front hub and the four PCs in the figure is in an equilibrium state, so the arc length between the hub and each PC is substantially equal. In addition, since the three PCs connected to the router connected to the hub are in equilibrium with each other, the forces acting on the connection to the router are in a balanced state, so that the arc lengths between the router and each of the three PCs are substantially equal. Further, two PCs are similarly connected to the router that is sequentially connected to the router, and the arc length between the router and the PC is substantially equal. By arranging in this way, it is possible to prevent the hubs, routers, and PCs from overlapping each other compared to the case where the distances between the hubs, routers, and PCs are different. Thereby, it is possible to realize easy-to-see graph drawing.

  When the network device name and the link information etc. are displayed on the arc in the nodes (symbol images of the respective network devices) in FIGS. 13 and 14, the illustration becomes even easier to understand.

  As described above, according to the third embodiment, the graph figure placement unit 19 in the network device monitoring apparatus 10 places the graph figure with the monitored network device as a node, and sets the target distance value between the nodes. And the corresponding actual node-to-node distance, define the force that acts between the nodes, and sequentially change the node placement so that the force that acts between the nodes that are subject to graphic placement is balanced on the planar placement By doing so, it is possible to realize an arrangement in which the connection structure of network devices on the network is easily visible.

  Further, according to the third embodiment, the contribution ratio of the correlation between the set target value of the distance between the nodes with respect to the value of the evaluation function F and the corresponding actual distance between the nodes is set as the set target value of the distance between the nodes. Alternatively, since the function that tends to decrease with respect to the graph theoretical distance between nodes or the distance between nodes is used as the evaluation function, locality is considered while considering the balance of the force F acting on the connection between network devices on the network. It is possible to perform graph graphic arrangement in which force F acting on connection between various network devices is balanced.

Furthermore, according to the third embodiment, the evaluation function F _ij of nodes for values i, actual node i to the ideal distance e _ij between j, the contribution rate of the correlation between the distance d _ij between j f (I _ij ) Is a function that tends to decrease with respect to the graph theoretical distance I _ij between the nodes i and j and the ideal distance e _ij between the nodes i and j, the graph theoretical distance I _ij between the nodes i and j. enough to leaves account the value of the evaluation function F _ij, relative function values representing the correlation between the actual distance d _ij and the ideal distance e _ij (e.g., an error between the actual distance d _ij and the ideal distance e _ij) It is possible to reduce the overall size, and it is possible to reduce the overlapping of the nodes that are too close to each other.

Embodiment 4 FIG.
In the fourth embodiment, the graph graphic arrangement method according to the first and second embodiments is applied to a server device of a community website (Social Network Service), so that a user terminal using the site can have a friendship relationship or the like. The graph is arranged and drawn in association with the predetermined relationship.

  The server device according to the fourth embodiment includes the configuration of the graph graphic arrangement device shown in FIG. 1 of the first embodiment, and the graph graphic arrangement unit 4 is the first embodiment, the second embodiment, or the first embodiment. The graphic figure arrangement process shown in any one of the forms 3 is executed. In addition, the graph graphic drawing unit 6 has a function of converting the graph graphic data determined by the graph graphic arranging unit 4 into Web data. Further, the graph data storage unit 7 stores graph graphic data in which a symbol image associated with each user who uses the community website and a predetermined relationship that defines a connection between the symbol images such as a friendship relationship are described. ing.

  Components required for the placement, drawing, and editing of the graph figure shown in any of the first embodiment, the second embodiment, or the third embodiment, including the graph figure arrangement unit 4 and the graph figure drawing unit 6 For example, by executing a friendship relationship display program for a community website in accordance with the gist of the present invention on a computer processing unit constituting the server device according to the fourth embodiment and controlling its operation, the software and hardware It can be realized as a specific means in cooperation with the wear.

Next, the operation will be described.
FIG. 15 is a diagram showing each processing module of the friendship relationship display program of the community website that implements the server device according to the fourth embodiment of the present invention, and the details will be described with reference to this diagram and FIG.

  The processing module A is executed by a computer, which is a server device that manages a community website, to extract graph data in the management unit 3, the graph graphic arrangement unit 4, and the graph data storage unit 7 in FIG. Embody. For example, when the management unit 3 inputs a friendship relationship display request from the user terminal via the input device 1 or the like, the management unit 3 shifts the processing to the graph graphic arrangement unit 4 in accordance with the input request. The graph graphic arrangement unit 4 extracts, from the graph data storage unit 7, graph graphic data that defines a connection structure between a symbol image of a user according to a request and a symbol image related to the friendship relationship under the control of the management unit 3. To do.

  Next, when the processing module B is executed by a computer that is a server device that manages the community website, the graph graphic in the management unit 3, the graph graphic arrangement unit 4 and the graph data storage unit 7 in FIG. An arrangement process is implemented. For example, as described above, the graph graphic data extracted from the graph data storage unit 7 is used, and the graph graphic arrangement unit 4 is controlled by the management unit 3 as described in the first embodiment, the second embodiment, or the above. The graph graphic arrangement process shown in any of the third embodiments is executed, and the arrangement of the nodes, which are the user's symbol images, is automatically determined by the connection relation according to the friendship relation. The graph graphic data determined by the graph graphic layout unit 4 is stored in the graph data storage unit 7.

  Subsequently, the processing module C is executed by a computer that is a server device that manages the community Web site, so that the graphs in the management unit 3, the graph drawing unit 6, and the graph data storage unit 7 in FIG. Graphic drawing processing is realized. For example, the graph graphic drawing unit 6 reads out the graph graphic data determined as described above from the graph data storage unit 7 and converts it into a data format that can be displayed by the Web browser. For example, conversion to an existing markup language or the like can be considered.

  By downloading the converted graph graphic data to the requesting user terminal via the output device 8 or the like, the friendship relationship of the community website is displayed on the web browser of the user terminal. In this case, there is no arc crossing between the nodes indicating each user because of the graph graphic arrangement process shown in any of the first embodiment, the second embodiment, or the third embodiment. An easy-to-view display without overlapping is realized.

  FIG. 16 is a diagram illustrating a drawing example of a user friendship relationship that has been subjected to the graph figure arrangement process according to the fourth embodiment. In the example shown in FIG. 16, symbol images having the same size are used as nodes corresponding to users, and arcs between users indicate friendship relationships. As shown in FIG. 16, the nodes “Mr. A”, “Mr. T”, and “Mr. X” are connected by arcs of such a length that the nodes connected only to the own node do not overlap each other.

Connect only to the node indicating "T", "F", "G", "H", "I", "J", "K", "U", "V" “Mr. W” and “Mr. W” are arranged in a substantially point-symmetric manner by connecting them radially around the “Mr. T” node by arcs of the same length.
In addition, “Mr. B”, “Mr. D”, and “Mr. E”, which are connected only to the node “Mr. A”, are connected to each other in a radial manner around the node “Mr. However, the node “Mr. C” close to the node “Mr. H” is connected to “Mr. A” with an arc shorter than “Mr. B”, “Mr. D”, and “Mr. E”.
Furthermore, “Mr. L” and “Mr. Y”, which are connected only to the node “Mr. X”, are connected radially around the node “Mr. T” by arcs of the same length. The node of “Mr. Z” close to the node of “Mr.” is connected to “Mr. X” by an arc shorter than “Mr. L” and “Mr. Y”.

  The graph figure arrangement unit according to the present invention calculates a set target value of the distance between each node using a calculation formula indicating an increasing tendency with respect to the size of the node connected to each node at both ends of the arc, and calculates the calculated node Based on the set target value of the inter-distance, the arrangement of each node is determined non-hierarchically. Therefore, as shown in FIG. 16, arc crossing and node overlap can be prevented as much as possible regardless of the size of the node, and easy-to-see graph graphics can be drawn.

  Further, since two nodes connected via a plurality of arcs are removed from the graph figure as multiple branches, and the set target value is calculated for the distance between these nodes, as shown in FIG. As a result, a well-balanced arrangement is made, and an easy-to-see friendship display can be realized.

  Further, the sum of all function nodes representing the correlation between the set target value of the distance between the nodes and the corresponding actual distance between the nodes is defined as an evaluation function. By sequentially changing the node arrangement so that the value of becomes smaller on the plane arrangement, it is possible to realize an arrangement according to the characteristics of the connection structure corresponding to each user's node and its friendship.

  Further, as in the second and third embodiments, the contribution ratio of the correlation between the target value of the distance between the nodes with respect to the value of the evaluation function F and the corresponding actual distance between the nodes is set as the distance between the nodes. If the function that tends to decrease with respect to the target value or the distance between nodes in the graph theory or the distance between nodes is used as the evaluation function, the balance of the force F acting on each connection of the whole user displaying the friendship relationship is taken into consideration. The node arrangement in which the force F acting on the local connection between the nodes indicating the user is balanced can be performed.

  According to the arrangement method as described above, for example, “Mr. B”, “Mr. D”, and “Mr. E” are connected to “Mr. A” with arcs of the same length. , “Mr. C” node close to “Mr. H” node should be connected to “Mr. A” with an arc shorter than “Mr. B”, “Mr. D”, and “Mr. E” so as not to overlap each other. Be placed.

  As shown in FIG. 16, each user name may be written on a node representing a user, and an image image of a personal homepage may be used as a symbol image used for each node. Thereby, the friendship relationship of the community website can be easily and visually expressed.

  As described above, according to the fourth embodiment, when the graph graphic placement unit in the server device managing the community website places the graph figure having the user of the community website as a node, both ends of the arc in the graph figure The target for setting the distance between each node using a calculation formula that prescribes the size and correlation of the nodes connected to each node, particularly a calculation formula that shows an increasing tendency with respect to the size of the nodes connected to each node at both ends of the arc Since the value is calculated, and the arrangement of each node is determined non-hierarchically based on the calculated setting target value of the distance between nodes, the graph figure is arranged according to the size of the node corresponding to each user, It is possible to display user friendships in such a manner that there are few arc crossings and node overlaps.

  In addition, according to the fourth embodiment, in the arrangement of the graph figure having the user of the community website as a node, the set target value of the distance between the nodes with respect to the value of the evaluation function F, the corresponding actual inter-node distance, By using a function that tends to decrease the target value of the distance between nodes as a setting target value of the distance between nodes, the distance in the graph theory between nodes, or the distance between nodes as an evaluation function, the user of the community website Considering the balance of the force F acting between the nodes representing the graph graphic arrangement in which the forces F acting between the local nodes are balanced, an easy-to-see friendship display can be realized.

  Furthermore, according to the fourth embodiment, in the arrangement of the graph figure having the user of the community website as a node, the function value representing the correlation between the set target value of the distance between the nodes and the corresponding actual distance between the nodes. Since the sum of all nodes in the graph figure to be arranged is defined as an evaluation function, and the node arrangement is sequentially changed so that the value of this evaluation function becomes small on the plane arrangement, A graph figure is arranged according to the characteristics of the connection structure based on the relationship between predetermined nodes such as a relationship, and an easy-to-read friendship display can be realized.

It is a block diagram which shows the structure of the graph figure arrangement | positioning apparatus by Embodiment 1 of this invention. 3 is a flowchart showing a flow of processing for removing multiple branches and self-closing in a graph figure by the graph figure processing apparatus according to the first embodiment. 4 is a flowchart showing a flow of graph graphic arrangement by the graph graphic arrangement unit of the first embodiment. 4 is a flowchart illustrating a flow of graph graphic editing processing by the graph graphic arrangement device according to the first embodiment. It is a figure which shows the example of a graph figure drawing. It is a figure which shows the other example of drawing of a graph figure. 10 is a flowchart showing a flow of graph graphic arrangement by the graph graphic arrangement unit of the second embodiment. FIG. 10 is a diagram illustrating a drawing example of a graph figure that has been subjected to the graph figure arrangement process according to the second embodiment. FIG. 10 is a diagram illustrating a drawing example of a graph figure that has been subjected to the graph figure arrangement process according to the second embodiment. FIG. 10 is a diagram illustrating a drawing example of a graph figure that has been subjected to the graph figure arrangement process according to the second embodiment. It is a block diagram which shows the structure of the graph figure arrangement | positioning apparatus by Embodiment 3 of this invention. 12 is a flowchart showing a flow of graph graphic layout editing processing by the graph graphic layout device of the third embodiment. FIG. 10 is a diagram illustrating a graph graphic drawing example of a network device that has been subjected to graph graphic arrangement processing according to the third embodiment. FIG. 10 is a diagram illustrating a graph graphic drawing example of a network device that has been subjected to graph graphic arrangement processing according to the third embodiment. It is a figure which shows each process module of the friendship display program of the community Web site which implement | achieves the server apparatus by Embodiment 4 of this invention. It is a figure which shows the example of drawing of the user friendship relationship which performed the graph figure arrangement | positioning process by Embodiment 4. FIG.

Explanation of symbols

  DESCRIPTION OF SYMBOLS 1,9 Input device, 2 Processing apparatus, 3 Management part, 4,19 Graph figure arrangement part, 5,18 Graph figure edit part, 6 Graph figure drawing part, 7,22 Graph data storage part, 8,11 Output device, DESCRIPTION OF SYMBOLS 10 Network equipment monitoring apparatus, 12 System management part, 13 Network equipment data management part, 14 Network equipment data output part, 15 Network equipment data processing part, 16 Network equipment data storage part, 17 Graph editor management part, 20 Graph figure output part , 21 Graph data extraction unit.

Claims (13)

  The graph graphic arrangement unit stores the graph graphic from the graph data storage unit that stores, as data, a graph graphic composed of a plurality of nodes and an arc defined as a line connecting the nodes having connection relation among these nodes. By determining the placement of each node in a non-hierarchical manner based on the set target value of the distance between nodes calculated from a calculation formula that correlates with the size of the node connected to each node at both ends of the arc, A graph graphic arrangement method for arranging the graph graphic.   The graph graphic arrangement unit uses a function having an increasing tendency with respect to the size of the node as a calculation formula correlated with the size of the node connected to each node at both ends of the arc. Graph shape placement method.   The graph figure arrangement unit calculates a set target value of the distance between nodes connected via a plurality of arcs based on the set target value of the distance between nodes at both ends of each arc constituting the path between the nodes. 3. The graphic pattern arrangement method according to claim 1 or 2, wherein:   The graph figure placement unit uses the sum of all the nodes representing the correlation between the set target value of the distance between the nodes and the corresponding actual distance between the nodes as the evaluation function. 4. The graph graphic layout method according to claim 1, wherein the node layout is sequentially changed so as to be small on the layout.   The graph graphic placement unit is the target of graphic placement using an evaluation function that defines the force acting between nodes based on the difference between the set target value of the distance between nodes and the corresponding distance between actual nodes. 4. The graphic figure arrangement method according to claim 1, wherein the node arrangement is sequentially changed so that the force acting between the nodes is in an equilibrium state on the planar arrangement. .   The graph graphic arrangement unit calculates the contribution ratio of the correlation between the set target value of the distance between the nodes to the evaluation function value and the corresponding distance between the actual nodes, the set target value of the distance between the nodes or the corresponding actual value. 5. The graph graphic arrangement method according to claim 4, wherein the graph graphic function is a function having a decreasing tendency with respect to at least one of the distances between the nodes.   The graph figure placement unit calculates the contribution ratio of the correlation between the target setting value of the distance between nodes to the evaluation function value and the corresponding distance between actual nodes, the target setting value of the distance between the nodes, and between the nodes. 6. The graph graphic arrangement method according to claim 5, wherein the graph graphic arrangement method is a function having a decreasing tendency with respect to at least one of a theoretical distance and a corresponding distance between actual nodes.   The graph graphic is taken out from a graph data storage unit that stores as a data a graph graphic composed of a plurality of nodes and an arc defined as a line connecting the nodes having connection relation among these nodes, Based on the set target value of the distance between nodes calculated from a calculation formula correlated with the size of the node connected to each node, the arrangement of the graph figure is determined by determining the arrangement of each node in a non-hierarchical manner. A program that causes a computer to function as a graph figure placement unit to be performed.   9. The graph graphic arrangement unit uses a function having an increasing tendency with respect to the size of the node as a calculation formula correlated with the size of the node connected to each node at both ends of the arc. program.   The graph figure arrangement unit calculates a set target value of the distance between nodes connected via a plurality of arcs based on the set target value of the distance between nodes at both ends of each arc constituting the path between the nodes. 10. The program according to claim 8 or 9, wherein: A graph data storage unit that stores, as data, a graph figure composed of a plurality of nodes and an arc defined as a line connecting the nodes having a connection relationship among these nodes;
Taking out the graph figure from the graph data storage unit, and arranging each node based on a set target value of the distance between nodes calculated from a calculation formula correlated with the size of the node connected to each node at both ends of the arc A graph graphic arrangement apparatus comprising: a graph graphic arrangement unit that arranges the graph graphic by determining non-hierarchically.   The graph graphic arrangement unit uses a function having an increasing tendency with respect to the size of the node as a calculation formula correlated with the size of the node connected to each node at both ends of the arc. Graph graphic placement device.   The graph figure arrangement unit calculates a set target value of the distance between nodes connected via a plurality of arcs based on the set target value of the distance between nodes at both ends of each arc constituting the path between the nodes. The graph graphic arrangement device according to claim 11 or 12, characterized in that:

Images