CN115913975A - Directed topology graph layout method, device, electronic equipment and storage medium - Google Patents

Abstract

The present invention provides a directed topological graph layout method, device, electronic equipment and storage medium. The method includes: obtaining original data, wherein the original data includes nodes and directed connections, and the directed connections are used to connect Connect the nodes of the relationship to obtain node links; determine at least one starting node in the node based on the directed connection; determine the longest node link and determine the second node link among multiple node links starting from the starting node Long node link; determine the first queue number of the directed topology graph based on the longest node link; determine the second queue number of the directed topology graph based on the second long node link; based on the first queue number and the second queue number , determine the coordinate space of the directed topological graph, and place the nodes in the coordinate space according to the sort order in the node link; connect the nodes with connection relationship. Through the present invention, the topology diagram with multiple starting points and multiple connection points can be laid out to obtain a topology diagram with higher readability.

Description

Directed topology graph layout method, device, electronic equipment and storage medium

technical field

The present invention relates to the technical field of topological graph layout, in particular to a directed topological graph layout method, device, electronic equipment and storage medium.

Background technique

In related technologies, based on the development of information technology visualization, the graph layout algorithm is used to process scattered nodes, so that the topological relationship between nodes can be presented more clearly, so as to facilitate the implementation of relevant analysis operations.

However, in the current drawing method of the network topology map, it is impossible to realize the layout of multiple starting points and multiple connection points, and thus the readability of the layout cannot be improved. Therefore, looking for a topology map layout method that can realize multiple starting points and multiple connection points has become a current research hotspot.

Contents of the invention

The present invention provides a directed topological map layout method, device, electronic equipment and storage medium, which are used to solve the defects in the prior art that the topological map layout with multiple starting points and multiple connection points cannot be realized, and the readability of the layout cannot be improved. It realizes the layout of the topology diagram with multiple starting points and multiple connection points, and can obtain a topology diagram with higher readability.

The present invention provides a directed topological graph layout method. The directed topological graph layout method includes: obtaining original data, wherein the original data includes nodes and directed connections, and the directed connections are used for The nodes in the connection relationship are connected to obtain node links; based on the directed connection, at least one starting node is determined among the nodes; among the plurality of node links starting from the starting node , determine the longest node link, and determine the second long node link, wherein the longest node link includes the first node, the first node and the second node of the second long node link There is a connection relationship, the second node is the starting node of the second long node link; based on the longest node link, determine the first queue number of the directed topology graph; based on the second long node Links, determining the number of second queues in the directed topology graph, wherein the first queue is set along the first direction, the second queue is set along the second direction, and the first direction and the second direction form a preset angle; based on the The first number of queues and the second number of queues, determine the coordinate space of the directed topology graph, and place the nodes in the coordinate space correspondingly according to the sort order in the node link; there will be connections The nodes of the relationship are connected.

According to a directed topological graph layout method provided by the present invention, before determining the first queue number of the directed topological graph based on the longest node link, the method further includes: A complex node is determined on the link, wherein the complex node is a node whose number of connection stubs exceeds a threshold value, and the connection stub is a fixed point on the node, which is used to realize the connection between the node and the directed link connected; said determining the first number of queues in the directed topology graph based on the longest node link specifically includes: determining the first number of complex nodes; determining the second number of nodes in the longest node link Quantity; based on the first quantity and the second quantity, determine a first queue quantity of the directed topology graph.

According to a directed topology graph layout method provided by the present invention, the determining the second queue number of the directed topology graph based on the second long node link specifically includes: determining the number of queues in the second long node link A third number of nodes; based on the third number, determining a second queue number of the directed topology graph.

According to a directed topological graph layout method provided by the present invention, the corresponding positioning of the nodes in the coordinate space according to the sort order in the node link specifically includes: the first number of complex nodes is greater than zero In the case of , set the longest node link in the intermediate queue in the second queue in the coordinate space; extract each node in the longest node link, and according to the node in the longest The sorting order in the long node link is to traverse and set the coordinates of the nodes in the intermediate queue, wherein the first direction coordinates of the nodes are fixed, and the second direction coordinates of the nodes are incremented according to the preset value; based on the The second directional coordinates of the first node in the longest node link, determine the second directional coordinates of the second node in the second long node link; set the second long node link In the target queue in the coordinate space, wherein the target queue is the queue where the second direction coordinates of the second node are located; extract each node in the second long node link, and according to the node in the The arrangement sequence in the second long node link, the coordinates of the nodes are set in the target queue traversal, wherein the second direction coordinates of the nodes are fixed, and the first direction coordinates of the nodes are incremented according to the preset value ; extract the remaining nodes, wherein the remaining nodes are other nodes except the node of the longest node link and the node of the second long node link; based on the node of the longest node link Coordinates, or the coordinates of the nodes of the second long node link, determine the coordinates of the remaining nodes; extract the free start node, and set the free start node in the coordinate space in turn The initial queue in the first queue, wherein the free initial node is an initial node that has no connection relationship with other nodes.

According to a directed topological graph layout method provided by the present invention, according to the sorting order of the nodes in the longest node link, traversing and setting the coordinates of the nodes in the intermediate queue specifically includes: The sorting order of the nodes in the longest node link determines the next node of the complex node; compared with the second direction coordinates of the complex node, the complex node is set in the intermediate queue When the second direction coordinate of the next node of , it is incremented according to the preset multiple of the preset value.

According to a directed topological graph layout method provided by the present invention, the determining the coordinates of the remaining nodes based on the coordinates of the node of the longest node link specifically includes: determining the coordinates of the remaining nodes among the remaining nodes The nodes in the longest node link are connected to the first remaining nodes, and based on the second direction coordinates of the nodes in the longest node link, determine the second direction coordinates of the first remaining nodes; determine A first remaining node link including the first remaining node, wherein a node in the first remaining node link is a node in the remaining node; setting the first remaining node link in the The first remaining node link queue in the coordinate space, wherein the first remaining node link queue is the queue where the second direction coordinates of the first remaining node are located; each node in the first remaining node link is extracted , and according to the arrangement order of the nodes in the first remaining node link, set the coordinates of the nodes in the first remaining node link queue traversal, wherein the second direction coordinates of the nodes are fixed, The first direction coordinates of the nodes are incremented or decremented according to a preset value.

According to a directed topology graph layout method provided by the present invention, the determining the coordinates of the remaining nodes based on the coordinates of the nodes of the second long node link specifically includes: determining the coordinates of the remaining nodes in the remaining nodes The nodes in the second long node link have second remaining nodes that are connected, and based on the first direction coordinates of the nodes in the second long node link, determine the first direction of the second remaining node coordinates; determine the second remaining node link including the second remaining node, wherein the node in the second remaining node link is a node in the remaining node; set the second remaining node link The second remaining node link queue in the coordinate space, wherein the second remaining node link queue is the queue where the first direction coordinates of the second remaining node are located; extract the second remaining node link Each node in, and according to the arrangement order of the nodes in the second remaining node link, set the coordinates of the node in the second remaining node link queue traversal, wherein, the first of the node The direction coordinates are fixed, and the second direction coordinates of the nodes increase or decrease according to a preset value.

According to a directed topological graph layout method provided by the present invention, the first direction and the second direction form a preset angle, specifically including: the first direction and the second direction form an angle of 90 degrees, wherein , the first direction is the direction indicated by each column of the directed topological map and the second direction is the direction indicated by each row of the directed topological map; or the first direction is the direction indicated by the directed topological map The direction indicated by each row of the directed topology map and the second direction is the direction indicated by each column of the directed topology map.

According to a directed topological graph layout method provided by the present invention, the connecting the nodes having a connection relationship specifically includes: connecting to the directed link through a connecting pile set on the node, and Realize that the node is connected with other nodes that have a connection relationship based on the directed connection, wherein the position distribution of the connection piles on the node is determined in the following manner: determine the number of connection piles of the node; Based on the preset mapping table, the position distribution of each connection pile on the node in each node is determined, wherein the mapping table includes the corresponding relationship between the number of connection piles and the position distribution of each connection pile on the node, and the connection The piles are evenly distributed on the nodes in a preset position order.

The present invention also provides a directed topological graph layout device, the directed topological graph layout device includes: a first module for acquiring original data, wherein the original data includes nodes and directed links, and the directed The directed connection is used to connect the nodes with the connection relationship to obtain the node link; the second module is used to determine at least one starting node in the nodes based on the directed connection; the third module uses Among the plurality of node links starting from the starting node, determining the longest node link and determining the second long node link, wherein the longest node link includes the first node , the first node has a connection relationship with the second node of the second long node link, and the second node is the starting node of the second long node link; the fourth module is configured to The longest node link is used to determine the first queue number of the directed topology graph; the fifth module is used to determine the second queue number of the directed topology graph based on the second long node link, wherein the first queue Arranged along the first direction, the second queue is arranged along the second direction, the first direction and the second direction form a preset angle; the sixth module is used to, based on the number of the first queue and the number of the second queue, Determining the coordinate space of the directed topological graph, and correspondingly positioning the nodes in the coordinate space according to the sort order in the node link; the seventh module is used to connect the nodes with connection relationship .

The present invention also provides an electronic device, including a memory, a processor, and a computer program stored on the memory and operable on the processor. When the processor executes the program, the directional Topology map layout method.

The present invention also provides a non-transitory computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the directed topology graph layout method as described in any one of the above is implemented.

The present invention also provides a computer program product, including a computer program. When the computer program is executed by a processor, the directed topology graph layout method described in any one of the above is implemented.

The directed topological graph layout method, device, electronic equipment and storage medium provided by the present invention determine the longest node link and the second longest node link among multiple node links starting from the starting node; and based on The longest node link determines the first queue number of the directed topology graph; determines the second queue number of the directed topology graph based on the second longest node link; and then determines the directed queue number based on the first queue number and the second queue number. The coordinate space of the topology map, and the nodes are placed in the coordinate space according to the order of the node links; the nodes with connection relationships can be connected to obtain a topology map of the original data with a clear structure and high readability . In this way, the layout of the topology diagram with multiple starting points and multiple connection points can be realized, and a topology diagram with higher readability can be obtained.

Description of drawings

In order to more clearly illustrate the present invention or the technical solutions in the prior art, the accompanying drawings that need to be used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the accompanying drawings in the following description are the present invention. For some embodiments of the invention, those skilled in the art can also obtain other drawings based on these drawings without creative effort.

Fig. 1 is one of the schematic flow charts of the directed topological graph layout method provided by the present invention;

Fig. 2 is a schematic diagram of an application scenario for determining a starting node provided by the present invention;

Fig. 3 is a schematic diagram of an application scenario for determining the longest node link provided by the present invention;

FIG. 4 is a schematic diagram of an application scenario for determining a second long node link provided by the present invention;

Fig. 5 is a schematic flow diagram of determining the first queue number of a directed topology graph based on the longest node link provided by the present invention;

Fig. 6 is a schematic flow diagram of placing nodes in the coordinate space according to the sort order in the node links provided by the present invention;

Fig. 7 is a schematic flow diagram of determining the coordinates of the remaining nodes based on the coordinates of the node of the longest node link provided by the present invention;

Fig. 8 is a schematic flowchart of determining the coordinates of the remaining nodes based on the coordinates of the nodes of the second long node link provided by the present invention;

Fig. 9 is a schematic diagram of an application scenario of the directed topological graph layout method provided by the present invention;

Fig. 10 is a schematic structural diagram of a directed topology graph layout device provided by the present invention;

Fig. 11 is a schematic structural diagram of an electronic device provided by the present invention.

Detailed ways

In order to make the purpose, technical solutions and advantages of the present invention clearer, the technical solutions in the present invention will be clearly and completely described below in conjunction with the accompanying drawings in the present invention. Obviously, the described embodiments are part of the embodiments of the present invention , but not all examples. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without creative efforts fall within the protection scope of the present invention.

In order to further introduce the directed topology graph layout method provided by the present invention, it will be described below in conjunction with FIG. 1 .

Fig. 1 is one of the schematic flow charts of the directed topological graph layout method provided by the present invention.

In an exemplary embodiment of the present invention, referring to FIG. 1 , it can be seen that the directed topology graph layout method may include step 110 to step 170, and each step will be introduced below.

In step 110, the original data is obtained, wherein the original data includes nodes and directed links, and the directed links are used to connect nodes with a connection relationship to obtain node links.

In step 120, at least one starting node among the nodes is determined based on the directed link.

In one embodiment, the raw data may be raw data about network topology nodes. Wherein, the original data may include nodes and directed connections associated with the nodes. Wherein, the direction of the directed line represents the transmission direction.

In an example, a directed link may include a start end and an end end, and the start end and the end end of the directed link may be connected with nodes, or may be empty.

It can be understood that, for node A, if node A is connected to the starting end of directed link a, then node A can also be called the starting node of directed link a. If no node is connected to the start of directed link a, then the start of directed link a is empty.

For node A, if node B is connected to the terminal end of directed link a, then node B can also be called the target node of directed link a. If no node is connected to the end of directed link a, then the end of directed link a is empty.

It can be understood that all directed links link nodes recursively, and multiple node links can be obtained.

In an embodiment, the starting node may be determined based on the directed link. Among them, there can be multiple starting nodes.

In one example, the start node may be the target node of a directed link that is initially empty. FIG. 2 is a schematic diagram of an application scenario for determining a starting node provided by the present invention. It can be seen from FIG. 2 that a node marked with a dotted line box can be understood as a starting node.

In step 130, among the plurality of node links starting from the starting node, determine the longest node link, and determine the second long node link, wherein the longest node link includes the first node, the second longest node link A node has a connection relationship with a second node of the second long node link, and the second node is a starting node of the second long node link.

In an embodiment, the longest node link may be determined among multiple node links starting from the starting node. Wherein, the longest node link may be the link containing the largest number of nodes. FIG. 3 is a schematic diagram of an application scenario for determining the longest node link provided by the present invention. Combining with FIG. 3 , it can be seen that the node link marked with a dotted line box can be understood as the longest node link.

It should be noted that, when there are two longest node links, any one may be selected as the final longest node link, which corresponds to the longest node link in this embodiment.

In yet another embodiment, the second long node link may also be determined. Wherein, the second long node link can be understood as the longest node link formed based on the remaining nodes except the nodes in the longest node link. There is a connection relationship between the first node in the longest node link and the second node in the second longest node link. Wherein, the first node may be any node on the longest node link, and the second node may be understood as the starting node of the second longest node link.

FIG. 4 is a schematic diagram of an application scenario for determining the second long node link provided by the present invention. Combining with FIG. 4 , it can be seen that the node link marked with a dotted line box can be understood as the second long node link. Wherein, the first node may correspond to the firewall node in FIG. 4 , and the second node may correspond to the ICG node in FIG. 4 .

In step 140, the first queue number of the directed topology graph is determined based on the longest node link.

In an exemplary embodiment of the present invention, continue to take the embodiment shown in Figure 1 as an example for description, before determining the first queue number (corresponding to step 140) of the directed topology graph based on the longest node link, there is The topology map layout method may also include: determining a complex node on the longest node link, wherein the complex node is a node whose number of connection piles exceeds a threshold value, wherein the connection piles may be fixed points on the node for realizing Nodes are connected with directed links.

In an embodiment, the quantity threshold may be adjusted according to actual conditions, for example, it may be 4. In this embodiment, the quantity threshold is not specifically limited. To illustrate with reference to FIG. 3 , on the longest node link, since the number of connection stubs of the firewall is 5, which exceeds the number threshold, it can be determined that the firewall node is a complex node.

Fig. 5 is a schematic flowchart of determining the first queue number of a directed topology graph based on the longest node link provided by the present invention.

It can be seen from FIG. 5 that, based on the longest node link, determining the first number of queues in the directed topology graph may include steps 510 to 530, and each step will be introduced below.

In step 510, a first number of complex nodes is determined.

In step 520, a second number of nodes in the longest link of nodes is determined.

In step 530, based on the first number and the second number, a first queue number of the directed topology graph is determined.

Continuing to describe in conjunction with FIG. 3 , it is determined that the complex node is a firewall node, that is, the first number is 1. Further, the number of nodes (corresponding to the second number) in the longest node link may also be determined, for example, the second number in FIG. 3 is 5. Then determine the first number of queues in the directed topology graph based on the first number and the second number.

In an example, the number of columns in the directed topological graph may be the sum of the first number and the second number. For the embodiment described in FIG. 3 , the determined first number of queues in the directed topological graph is 1+ 5=6. In yet another embodiment, the first number of queues in the directed topology graph may also be the sum of the first number and any positive integer greater than the second number. In this embodiment, the process of determining the first number of queues in the directed topology graph is not specifically limited.

In step 150, based on the second long node link, determine the second queue number of the directed topology graph, wherein the first queue is set along the first direction, the second queue is set along the second direction, the first direction and the second Orientation is at a preset angle.

It should be noted that the preset angle can be adjusted according to actual conditions, and the preset angle is not specifically limited in this embodiment.

In an exemplary embodiment of the present application, the preset angle between the first direction and the second direction may be implemented in the following manner:

The first direction and the second direction form an angle of 90 degrees. Wherein, the first direction is the direction indicated by each column of the directed topological map and the second direction is the direction indicated by each row of the directed topological map; or the first direction is the direction indicated by each row of the directed topological map and the second direction is the direction indicated by each row of the directed topological map The two directions are the directions indicated by the columns of the directed topology graph. It can be understood that setting the first direction and the second direction to form an angle of 90 degrees can ensure that the obtained topological map is horizontal and vertical, further improving the readability of the topological map.

Wherein, the first queue number may refer to the column number of the directed topology graph and the second queue number may refer to the row number of the directed topology graph; or, the first queue number may refer to the row number of the directed topology graph and the second queue number may refer to the row number of the directed topology graph The second number of queues may refer to the number of columns in the directed topology graph.

The first direction coordinates of the nodes may refer to the coordinates along the directions indicated by the columns of the directed topology graph (corresponding to the ordinate in the coordinate space) and the second direction coordinates of the nodes may refer to the coordinates along the directions indicated by the rows of the directed topology graph. The coordinates of the indicated direction (corresponding to the abscissa in the coordinate space); or the first direction coordinates of the node may refer to the coordinates of the direction indicated along the rows of the directed topology graph (corresponding to the abscissa in the coordinate space) and the node's The second direction coordinates may refer to coordinates along the directions indicated by the columns of the directed topology map (corresponding to the ordinate in the coordinate space).

For ease of description, in the present invention, the first queue number refers to the column number of the directed topology graph and the second queue number refers to the row number of the directed topology graph, and the first direction coordinate of the node refers to the row number along the directed topological graph. The coordinates of the direction indicated by each column of the topology map (the ordinate in the corresponding coordinate space) and the second direction coordinates of the node refer to the coordinates along the direction indicated by each row of the directed topology map (the abscissa in the corresponding coordinate space ) as an example for illustration.

In one embodiment, based on the second long node link, determining the second queue number of the directed topology graph may be implemented in the following manner:

determining a third number of nodes in the second long node link;

Based on the third quantity, the second queue quantity of the directed topology graph is determined.

Continuing with the description in FIG. 4 , the number of nodes (corresponding to the third number) in the second long node link may be determined, for example, the third number in FIG. 4 is 2. Further, the second queue number of the directed topology graph may be determined based on the third number. In an example, the second number of queues in the directed topology graph may be the third number*2+1. For the embodiment shown in FIG. 4 , the determined second queue number of the directed topology graph is 2*2+1=5.

In step 160, based on the first number of queues and the second number of queues, the coordinate space of the directed topology graph is determined, and the nodes are correspondingly placed in the coordinate space according to the sort order in the node links.

In step 170, connect the nodes with connection relationship.

In an embodiment, based on the determined number of columns and rows of the directed topological graph, the coordinate space of the directed topological graph can be determined. Among them, FIG. 9 is a schematic diagram of an application scenario of the directed topological graph layout method provided by the present invention, and the coordinate space can be determined based on the number of columns (corresponding to the number of first queues) and the number of rows (corresponding to the number of second queues). In the coordinate space shown in FIG. 9 , the unit length may be 100.

In yet another embodiment, in the coordinate space of the directed topological graph, all nodes related to the original data can be correspondingly placed in the coordinate space according to the sort order in the respective node links, and the Nodes are connected through the connection piles set on the nodes. In this way, it is possible to realize the layout of the topology map with multiple starting points and multiple connection points, and obtain a more readable topology map with horizontal and vertical node positions and a clear structure.

It should be noted that the nodes with a connection relationship include between nodes and between nodes, and may also include between nodes and empty positions. A connection relationship can be represented by a directed connection. To illustrate with reference to FIG. 9 , regarding a zero-trust TAC node, the other end of the connection relationship with the node may be empty.

The directed topological graph layout method provided by the present invention determines the longest node link and the second longest node link among multiple node links starting from the starting node; and determines the directed The first queue number of the topology graph; determine the second queue number of the directed topology graph based on the second long node link; then determine the coordinate space of the directed topology graph based on the first queue number and the second queue number, and The nodes are correspondingly placed in the coordinate space according to the sorting order in the node link; the nodes with connection relationship are connected, so that a topology map of the original data with clear structure and high readability can be obtained. In this way, the layout of the topology diagram with multiple starting points and multiple connection points can be realized, and a topology diagram with higher readability can be obtained.

In order to further introduce the directed topological graph layout method provided by the present invention, the process of placing nodes in the coordinate space correspondingly according to the sort order in the node links will be described below in conjunction with the following embodiments.

Fig. 6 is a schematic flow chart of placing nodes in the coordinate space according to the sort order in the node link provided by the present invention.

In an exemplary embodiment of the present invention, referring to FIG. 6 , it can be known that correspondingly placing nodes in the coordinate space according to the sorting order in the node link may include steps 610 to 680, and the steps will be introduced below.

In step 610, in case the first number of complex nodes is greater than zero, the longest node link is set in the middle queue of the second queue in the coordinate space.

In one embodiment, the second queue is described by taking the behavior of the coordinate space as an example. Therefore, the middle queue in the second queue in the coordinate space refers to the middle row in the coordinate space.

The first number of complex nodes can be determined, and if the first number is greater than zero, that is, if there are complex nodes, the longest node link can be set in the middle row of the coordinate space. To illustrate with reference to FIG. 9 , since there are complex nodes (firewall nodes), based on the previously determined number of rows in the coordinate space is 5 rows, the longest node link can be set in the third row of the coordinate space.

In yet another embodiment, if the first number is zero, there are no complex nodes. It can be understood that in this scenario, other nodes connected to complex nodes can be arranged under the longest node link without blocking the arrangement of other nodes. Therefore, the longest node can be Links are set on the first row of the coordinate space.

Through this embodiment, it is possible to ensure that all nodes are effectively laid out without being blocked by other nodes, thereby laying a foundation for obtaining a topological diagram of original data that is horizontal, vertical, clear in structure, and highly readable.

In step 620, each node in the longest node link is extracted, and according to the sorting order of the nodes in the longest node link, the coordinates of the nodes are traversed in the intermediate queue, wherein the first direction coordinates of the nodes are fixed, and the coordinates of the nodes are set. The coordinates of the second direction are incremented according to a preset value.

In one embodiment, each node in the longest node link can be extracted, and the coordinates of the nodes can be set in the middle row of the coordinate space according to the arrangement order of the nodes in the longest node link. In an example, starting from the starting node in the longest node link, each node can be set in sequence to the middle row, wherein the vertical coordinates of each node are the same, and the horizontal coordinates increase according to a preset value. Wherein, the preset value can be adjusted according to the actual situation, for example, it can be 100, and in this embodiment, the preset value is not specifically limited.

In yet another exemplary embodiment of the present invention, according to the sorting order of the nodes in the longest node link, traversing and setting the coordinates of the nodes in the intermediate queue can also be implemented in the following manner:

Determine the next node of the complex node according to the sorting order of the nodes in the longest node link;

Compared with the second direction coordinate of the complex node, when the second direction coordinate of the next node of the complex node is set in the intermediate queue, it is incremented according to the preset multiple of the preset value.

In one embodiment, continue to describe in conjunction with the embodiment shown in FIG. 9 , since the number of connection stubs of a complex node (such as a firewall node) exceeds four, then other nodes connected to the complex node, such as SDWA node, there may be other nodes connected to the SDWA node. In order to ensure that the connected nodes will not block each other, when setting the abscissa of the next node of the complex node (corresponding to the flow meter node in Figure 9), it can be incremented by twice the preset value, so that the A space is left between the firewall node and the flow meter node to provide space for the node connected to the SDWA node.

In step 630, based on the second directional coordinates of the first node in the longest node link, the second directional coordinate of the second node in the second longest node link is determined.

It should be noted that there is a connection relationship between the first node in the longest node link and the second node in the second longest node link. Wherein, the first node may be any node on the longest node link, and the second node may be understood as the starting node of the second longest node link. It can be seen from FIG. 9 that the first node may correspond to the firewall node in FIG. 9 , and the second node may correspond to the ICG node in FIG. 9 .

In an embodiment, since the second node has a connection relationship with the first node, the abscissa of the second node may be determined based on the abscissa of the first node. In an example, the abscissa of the first node may be the same as the abscissa of the second node. In this embodiment, based on the abscissa of the first node in the longest node link, the abscissa of the second node in the second longest node link is determined, which can effectively ensure that the lines in the formed topology diagram are horizontal and vertical Straight, which can improve the readability of the formed topology map.

In step 640, set the second long node link in the target queue of the coordinate space, wherein the target queue is the queue where the second direction coordinate of the second node is located.

In step 650, each node in the second long node link is extracted, and according to the arrangement order of the nodes in the second long node link, the coordinates of the set nodes are traversed in the target queue, wherein the second direction coordinates of the nodes are fixed, The first direction coordinate of the node is incremented according to the preset value.

In an embodiment, the second long node link may be set in a target queue in the coordinate space, where the target queue may refer to the column where the abscissa of the second node is located. For illustration with reference to FIG. 9 , the target queue may be the column where the ICG node is located.

Further, each node in the second long node link may be extracted, and the coordinates of the nodes are traversed in the target queue according to the arrangement order of the nodes in the second long node link. In an example, starting from the second node in the second long node link, each node can be sequentially set to the target queue, wherein the abscissa of each node is the same, and the ordinate increases according to a preset value. Wherein, the preset value can be adjusted according to the actual situation, for example, it can be 100, and in this embodiment, the preset value is not specifically limited.

In step 660, the remaining nodes are extracted, wherein the remaining nodes are other nodes except the node of the longest node link and the node of the second longest node link.

In step 670, the coordinates of the remaining nodes are determined based on the coordinates of the nodes of the longest node link, or the coordinates of the nodes of the second longest node link.

In one embodiment, the coordinates of the remaining nodes in the coordinate space can be determined. Wherein, the remaining nodes may be understood as other nodes except the node of the longest node link and the node of the second longest node link. Continuing to describe in conjunction with FIG. 9 , the remaining nodes may include zero-trust TAC nodes, CSMP nodes, SDWA nodes, VCPE nodes, and Dayu nodes.

Further, since the remaining nodes are connected to nodes in the longest node link, or to nodes on the second long node link, it can be based on the node coordinates of the longest node link, or the second long node link The node coordinates of determine the coordinates of the remaining nodes.

In step 680, extract the free start node, and set the free start node in the start queue in the first queue in the coordinate space in turn, wherein the free start node is not connected with other nodes starting node.

It should be noted that if the first queue refers to a column in the coordinate space, then the starting queue in the first queue in the coordinate space may refer to the first column in the coordinate space. In the present invention, for the convenience of description, it will be described by taking that the starting queue in the first queue refers to the first column in the coordinate space as an example.

In yet another embodiment, a detached starting node may also be determined among the remaining nodes, for example, a zero-trust TAC node. The free starting nodes can be sequentially set in the first column of the coordinate space.

In order to further introduce the process of determining the coordinates of the remaining nodes based on the coordinates of the longest node link provided by the present invention, the following will be described in conjunction with the following embodiments.

Fig. 7 is a schematic flowchart of determining the coordinates of the remaining nodes based on the coordinates of the node of the longest node link provided by the present invention.

In an exemplary embodiment of the present invention, referring to FIG. 7 , it can be seen that based on the coordinates of the node of the longest node link, determining the coordinates of the remaining nodes may include steps 710 to 740, and each step will be introduced below.

In step 710, determine the first remaining node that has a connection relationship with the node in the longest node link among the remaining nodes, and determine the first remaining node based on the second direction coordinates of the nodes in the longest node link The second direction coordinates of .

In an embodiment, the first remaining node that has a connection relationship with the node in the longest node link may be determined among the remaining nodes. Continuing to describe with reference to FIG. 9 , the first remaining node may be a CSMP node, a VCPE node, a Dayu node, and the like. During the application process, the abscissa of the first remaining node may be determined based on the abscissa of the nodes in the longest node link. Wherein, the first remaining node may be understood as the starting node of the first remaining node link.

In an example, for the WAF node in the longest node link, the abscissa of the VCPE node can be determined based on the abscissa of the WAF node, for example, the abscissa of the WAF node in the longest node link is the same as the first remaining node (VCPE nodes) have the same abscissa.

In yet another example, for the firewall node in the longest node link, the abscissa of the Dayu node may be determined based on the abscissa of the firewall node. For example, the abscissa of the firewall node in the longest node link is different from the abscissa of the first remaining node (Dayu node) by unit length.

In step 720, a first remaining node link including the first remaining node is determined, wherein a node in the first remaining node link is a node in the remaining nodes.

In step 730, set the first remaining node link in the first remaining node link queue in the coordinate space, wherein the first remaining node link queue is the queue where the second direction coordinates of the first remaining node are located.

In step 740, each node in the first remaining node link is extracted, and according to the arrangement order of the nodes in the first remaining node link, the coordinates of the nodes are traversed in the first remaining node link queue, wherein , the second direction coordinate of the node is fixed, and the first direction coordinate of the node increases or decreases according to the preset value.

It should be noted that if the second direction coordinate refers to the abscissa, then the first remaining node link queue can be understood as the queue where the abscissa of the first remaining node is located.

In an embodiment, a first remaining node link including the first remaining node may be determined, where each node in the first remaining node link is a node in the remaining nodes. Further, the first remaining node link is set in the first remaining node link queue in the coordinate space, wherein the first remaining node link queue is the column where the abscissa of the first remaining node is located. For illustration with reference to FIG. 9 , the first remaining node link queue may be the column where the VCPE node is located, and may also be the column where the Dayu node is located.

Further, each node in the first remaining node link may be extracted, and the coordinates of the nodes are set in the queue of the first remaining node link according to the arrangement sequence of the nodes in the first remaining node link.

In an example, starting from the first remaining node in the first remaining node link, other nodes can be sequentially set to the first remaining node link queue, wherein the abscissa of each node is the same, and the ordinate follows the preset The value is incremented or decremented. Wherein, the preset value can be adjusted according to the actual situation, for example, it can be 100, and in this embodiment, the preset value is not specifically limited.

In yet another embodiment, if the first remaining node has a connection relationship with the complex node, then the first remaining node may be set on the row where the longest node link is located. Continuing to describe with reference to FIG. 9 , for the CSMP node (the first remaining node), the CSMP node may be set above the row where the longest node link is located.

Through this embodiment, the remaining nodes can be sequentially arranged in the coordinate space of the directed topological graph, and it is ensured that the nodes do not block each other, laying a foundation for improving the readability of the directed topological graph.

In order to further introduce the process of determining the coordinates of the remaining nodes based on the coordinates of the nodes of the second long node link provided by the present invention, the following will be described in conjunction with the following embodiments.

FIG. 8 is a schematic flowchart of determining the coordinates of remaining nodes based on the coordinates of the nodes of the second long node link provided by the present invention.

In an exemplary embodiment of the present invention, it can be known with reference to FIG. 8 that determining the coordinates of the remaining nodes based on the coordinates of the nodes of the second long node link may include steps 810 to 840, and each step will be introduced below.

In step 810, a second remaining node that has a connection relationship with a node in the second long node link is determined among the remaining nodes, and based on the first direction coordinates of the nodes in the second long node link, the second The first direction coordinates of the remaining nodes.

In an embodiment, a second remaining node that has a connection relationship with a node in the second long node link may be determined among the remaining nodes. During the application process, the vertical coordinates of the second remaining nodes may be determined based on the vertical coordinates of the nodes in the second long node link. Wherein, the second remaining node may be understood as the starting node of the second remaining node link.

In step 820, a second remaining node link including the second remaining node is determined, wherein a node in the second remaining node link is a node in the remaining node.

In step 830, set the second remaining node link in the second remaining node link queue in the coordinate space, wherein the second remaining node link queue is the queue where the first direction coordinates of the second remaining node are located.

In step 840, each node in the second remaining node link is extracted, and according to the order in which the nodes are arranged in the second remaining node link, the coordinates of the nodes are traversed in the second remaining node link queue, wherein the node's The coordinates in the first direction are fixed, and the coordinates in the second direction of the node increase or decrease according to the preset value.

It should be noted that if the first direction coordinate represents the ordinate, then the queue where the first direction coordinate is located can be understood as the row where the ordinate is located. For the convenience of description, the queue where the first direction coordinate is located is taken as an example of the behavior where the vertical coordinate is located.

In an embodiment, a second remaining node link including the second remaining node may be determined, where each node in the second remaining node link is a node in the remaining node. Further, the second remaining node link is set in the second remaining node link queue in the coordinate space, wherein the second remaining node link queue is the row where the ordinate of the second remaining node is located.

Further, each node in the second remaining node link may be extracted, and the coordinates of the nodes are set in the queue of the second remaining node link according to the arrangement order of the nodes in the second remaining node link.

In an example, starting from the second remaining node in the second remaining node link, other nodes can be sequentially set to the second remaining node link queue, wherein the vertical coordinates of each node are the same, and the horizontal coordinates follow the preset The value is incremented or decremented. Wherein, the preset value can be adjusted according to the actual situation, for example, it can be 100, and in this embodiment, the preset value is not specifically limited.

Through this embodiment, the remaining nodes can be sequentially arranged in the coordinate space of the directed topological graph, and it is ensured that the nodes do not block each other, laying a foundation for improving the readability of the directed topological graph.

In yet another exemplary embodiment of the present invention, connecting nodes that have a connection relationship can be implemented in the following manner:

The connection piles set on the nodes are connected with the directed lines, and based on the directed lines, the nodes are connected with other nodes that have a connection relationship. The position distribution of the connection piles on the nodes can be determined in the following way:

Determine the number of connected stubs of the node;

Based on the preset mapping table, the position distribution of each connection pile on the node in each node is determined. The positional order is evenly distributed over the nodes.

In one embodiment, in order to ensure the regularity of the position distribution of the connection piles on each node, a mapping table can be set in advance, and based on the mapping table, the position distribution of each connection pile in each node on the node is determined, wherein the connection The piles are evenly distributed on the nodes in a preset position order. In an example, the mapping table may be as shown in Table 1.

Table 1 The relationship between the number of connection piles and the position distribution of each connection pile on the node

Number of connecting piles Location distribution of connecting piles (angle) 1 [180] 2 [180,0] 3 [180,270,0] 4 [180,270,0,90] 5 [180,270,315,0,90] 6 [180,270,315,0,45,90] 7 [180,270,315,0,45,90,135] 8 [180,270,315,0,45,90,135,225]

In yet another embodiment, the connecting piles may also be arranged on the edge side of each node. In the application process, taking the node as a circular shape as an example, the coordinates of the connecting piles can be determined based on the radius of the nodes and the position distribution of the connecting piles. Further, the nodes having the connection relationship are connected through the connection piles set on the nodes.

In yet another embodiment, the connection piles can also be set inside the nodes. In this embodiment, the specific setting positions of the connection piles are not limited, but the position distribution of the connection piles is required to be limited to ensure that each node will not block each other , and the connecting lines do not overlap each other, which improves the readability of the resulting directed topology graph.

According to the above description, it can be seen that the directed topological graph layout method provided by the present invention determines the longest node link and the second longest node link among multiple node links starting from the starting node; and based on the longest node The link determines the first queue number of the directed topology graph; determines the second queue number of the directed topology graph based on the second long node link; and then determines the directed topology graph based on the first queue number and the second queue number Coordinate space, and the nodes are placed in the coordinate space according to the sort order in the node link; connect the nodes with connection relationship, and you can get a topology map of the original data with clear structure and high readability. In this way, the layout of the topology diagram with multiple starting points and multiple connection points can be realized, and a topology diagram with higher readability can be obtained.

Based on the same idea, the present invention also provides a directed topological graph layout device.

The directed topological graph layout device provided by the present invention is described below, and the directed topological graph layout device described below and the directed topological graph layout method described above can be referred to in correspondence with each other.

Fig. 10 is a schematic structural diagram of a directed topological graph layout device provided by the present invention.

In an exemplary embodiment of the present invention, referring to FIG. 10 , it can be known that the directed topology graph layout device may include a first module 1010 to a seventh module 1070 , and each module will be introduced respectively below.

The first module 1010 may be configured to obtain original data, where the original data includes nodes and directed links, and the directed links are used to connect nodes with connection relationships to obtain node links;

The second module 1020 may be configured to determine at least one starting node among the nodes based on the directed link;

The third module 1030 may be configured to determine the longest node link among multiple node links starting from the starting node, and determine the second long node link, wherein the longest node link Including the first node, the first node has a connection relationship with the second node of the second long node link, and the second node is the starting node of the second long node link;

The fourth module 1040 may be configured to determine the first number of queues in the directed topology graph based on the longest node link;

The fifth module 1050 may be configured to determine the second queue number of the directed topology graph based on the second long node link, wherein the first queue is arranged along the first direction, and the second queue is arranged along the second direction, The first direction and the second direction form a preset angle;

The sixth module 1060 may be configured to determine the coordinate space of the directed topology graph based on the first number of queues and the second number of queues, and place the nodes in the coordinate space according to the sort order in the node link;

The seventh module 1070 may be configured to connect nodes that have a connection relationship.

In an exemplary embodiment of the present invention, the fourth module 1040 may also be configured to:

Determine the complex node on the longest node link, wherein the complex node is a node whose number of connection piles exceeds a threshold value, and the connection pile is a fixed point on the node, which is used to realize the connection between the node and the directed connection;

The fourth module 1040 may determine the number of first queues in the directed topology graph based on the longest node link in the following manner:

determining a first number of complex nodes;

determining a second number of nodes in the longest node link;

Based on the first quantity and the second quantity, a first queue quantity of the directed topology graph is determined.

In an exemplary embodiment of the present invention, the fifth module 1050 may determine the second number of queues in the directed topology graph based on the second long node link in the following manner:

determining a third number of nodes in the second long node link;

Based on the third quantity, the second queue quantity of the directed topology graph is determined.

In an exemplary embodiment of the present invention, the sixth module 1060 can place the nodes in the coordinate space according to the sort order in the node link in the following manner:

In case the first number of complex nodes is greater than zero, setting the longest node link in the intermediate queue of the second queue in the coordinate space;

Extract each node in the longest node link, and set the coordinates of the nodes in the intermediate queue according to the sorting order of the nodes in the longest node link. Among them, the coordinates of the first direction of the node are fixed, and the coordinates of the second direction of the node are according to The preset value is incremented;

determining a second directional coordinate of a second node in the second longest node link based on a second directional coordinate of the first node in the longest node link;

Setting the second long node link in the target queue of the coordinate space, wherein the target queue is the queue where the second direction coordinates of the second node are located;

Extract each node in the second long node link, and traverse the coordinates of the set nodes in the target queue according to the arrangement order of the nodes in the second long node link, wherein, the coordinates of the second direction of the node are fixed, and the coordinates of the first direction of the node The coordinates are incremented according to the preset value;

Extracting the remaining nodes, wherein the remaining nodes are other nodes except the node of the longest node link and the node of the second longest node link;

determining the coordinates of the remaining nodes based on the coordinates of the nodes of the longest node link, or the coordinates of the nodes of the second longest node link;

Extracting free starting nodes, and sequentially setting the free starting nodes in the starting queue in the first queue in the coordinate space, wherein the free starting nodes are starting nodes that are not connected to other nodes.

In an exemplary embodiment of the present invention, the sixth module 1060 can traverse and set the coordinates of the nodes in the intermediate queue according to the sort order of the nodes in the longest node link in the following manner:

Determine the next node of the complex node according to the sorting order of the nodes in the longest node link;

Compared with the second direction coordinate of the complex node, when the second direction coordinate of the next node of the complex node is set in the intermediate queue, it is incremented according to the preset multiple of the preset value.

In an exemplary embodiment of the present invention, the sixth module 1060 may determine the coordinates of the remaining nodes based on the coordinates of the node of the longest node link in the following manner:

Determine the first remaining node that has a connection relationship with the node in the longest node link among the remaining nodes, and determine the second direction coordinates of the first remaining node based on the second direction coordinates of the nodes in the longest node link ;

determining a first remaining node link including the first remaining node, wherein the nodes in the first remaining node link are nodes in the remaining nodes;

Setting the first remaining node link in the first remaining node link queue in the coordinate space, wherein the first remaining node link queue is the queue where the second direction coordinates of the first remaining node are located;

Extracting each node in the first remaining node link, and traversing the coordinates of the setting node in the first remaining node link queue according to the arrangement order of the nodes in the first remaining node link, wherein the second direction coordinate of the node is fixed, The first direction coordinate of the node is incremented or decremented according to the preset value.

In an exemplary embodiment of the present invention, the sixth module 1060 may determine the coordinates of the remaining nodes based on the coordinates of the nodes of the second long node link in the following manner:

Determine the second remaining node that has a connection relationship with the node in the second long node link among the remaining nodes, and determine the first direction coordinate of the node in the second long node link based on the first direction coordinate of the second remaining node direction coordinates;

determining a second remaining node link including a second remaining node, wherein a node in the second remaining node link is a node in the remaining node;

Setting the second remaining node link in the second remaining node link queue in the coordinate space, wherein the second remaining node link queue is the queue where the first direction coordinates of the second remaining node are located;

Extract each node in the second remaining node link, and traverse and set the coordinates of the nodes in the second remaining node link queue according to the arrangement order of the nodes in the second remaining node link, wherein the first direction coordinates of the nodes are fixed , the second direction coordinate of the node is incremented or decremented according to the preset value.

In an exemplary embodiment of the present invention, the fifth module 1050 can implement the preset angle between the first direction and the second direction in the following manner:

The first direction and the second direction form an angle of 90 degrees, wherein the first direction is the direction indicated by each column of the directed topology map and the second direction is the direction indicated by each row of the directed topology map; or the first direction is The direction indicated by each row of the directed topology map and the second direction is the direction indicated by each column of the directed topology map.

In an exemplary embodiment of the present invention, the seventh module 1070 may use the following method to connect nodes that have a connection relationship:

The connection piles set on the nodes are connected with the directed lines, and based on the directed lines, the nodes are connected with other nodes that have a connection relationship. Among them,

The position distribution of connection piles on nodes is determined in the following way:

Determine the number of connected stubs of the node;

Based on the preset mapping table, the position distribution of each connection pile on the node in each node is determined. The positional order is evenly distributed over the nodes.

Figure 11 illustrates a schematic diagram of the physical structure of an electronic device, as shown in Figure 11, the electronic device may include: a processor (processor) 1110, a communication interface (Communications Interface) 1120, a memory (memory) 1130 and a communication bus 1140, Wherein, the processor 1110 , the communication interface 1120 , and the memory 1130 communicate with each other through the communication bus 1140 . The processor 1110 may invoke logic instructions in the memory 1130 to execute a directed topological graph layout method. The method includes: obtaining original data, wherein the original data includes nodes and directed links, and the directed links are used Obtaining node links by connecting nodes with a connection relationship; based on the directed connection, at least one starting node is determined among the nodes; multiple node links starting from the starting node , determine the longest node link, and determine the second long node link, wherein the longest node link includes the first node, and the second node between the first node and the second long node link There is a connection relationship between the nodes, and the second node is the starting node of the second long node link; based on the longest node link, determine the first queue number of the directed topology graph; based on the second long node link The node link is to determine the number of second queues in the directed topology graph, wherein the first queue is set along the first direction, and the second queue is set along the second direction, and the first direction and the second direction form a preset angle; based on The first number of queues and the second number of queues determine the coordinate space of the directed topology graph, and place the nodes in the coordinate space according to the order in which they are sorted in the node links; there will be The nodes of the connection relationship are connected.

In addition, the above-mentioned logic instructions in the memory 1130 may be implemented in the form of software function units and may be stored in a computer-readable storage medium when sold or used as an independent product. Based on this understanding, the essence of the technical solution of the present invention or the part that contributes to the prior art or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in various embodiments of the present invention. The aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disk or optical disc, etc., which can store program codes. .

On the other hand, the present invention also provides a computer program product. The computer program product includes a computer program that can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can Executing the directed topological graph layout method provided by the above methods, the method includes: obtaining original data, wherein the original data includes nodes and directed links, and the directed links are used to connect nodes with connection relationships performing a connection to obtain a node link; based on the directed connection, determining at least one starting node among the nodes; and determining the longest node chain among multiple node links starting from the starting node and determining a second long node link, wherein the longest node link includes a first node, and the first node has a connection relationship with a second node of the second long node link, and the The second node is the starting node of the second long node link; based on the longest node link, determine the first queue number of the directed topology graph; based on the second long node link, determine the directed The second number of queues in the topology diagram, wherein the first queue is set along the first direction, the second queue is set along the second direction, and the first direction and the second direction form a preset angle; based on the first number of queues and The second number of queues determines the coordinate space of the directed topological graph, and places the nodes in the coordinate space according to the order in which they are sorted in the node links; connect.

In another aspect, the present invention also provides a non-transitory computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, it is implemented to execute the directed topology graph layout method provided by the above-mentioned methods. The method includes: obtaining original data, wherein the original data includes nodes and directed links, and the directed links are used to connect nodes with connection relationships to obtain node links; based on the directed links, At least one start node is determined among the nodes; among multiple node links starting from the start node, the longest node link is determined, and a second long node link is determined, wherein the The longest node link includes a first node, the first node has a connection relationship with the second node of the second long node link, and the second node is the start of the second long node link node; based on the longest node link, determine the first queue number of the directed topology graph; based on the second long node link, determine the second queue number of the directed topology graph, wherein the first queue is along the first queue One direction is set, the second queue is set along the second direction, the first direction and the second direction form a preset angle; based on the first number of queues and the second number of queues, determine the number of the directed topology graph coordinate space, and correspondingly place the nodes in the coordinate space according to the sorting order in the node link; connect the nodes with connection relationship.

The device embodiments described above are only illustrative, and the units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in One place, or it can be distributed to multiple network elements. Part or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment. It can be understood and implemented by those skilled in the art without any creative efforts.

Through the above description of the implementations, those skilled in the art can clearly understand that each implementation can be implemented by means of software plus a necessary general hardware platform, and of course also by hardware. Based on this understanding, the essence of the above technical solution or the part that contributes to the prior art can be embodied in the form of software products, and the computer software products can be stored in computer-readable storage media, such as ROM/RAM, magnetic discs, optical discs, etc., including several instructions to make a computer device (which may be a personal computer, server, or network device, etc.) execute the methods described in various embodiments or some parts of the embodiments.

It can be further understood that although operations are described in a specific order in the drawings in the embodiments of the present invention, it should not be understood as requiring that these operations be performed in the specific order shown or in a serial order, or that Perform all operations shown to obtain the desired result. In certain circumstances, multitasking and parallel processing may be advantageous.

Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: it can still be Modifications are made to the technical solutions described in the foregoing embodiments, or equivalent replacements are made to some of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the various embodiments of the present invention.

Claims (13)

1. A directed topological graph layout method, is characterized in that, described directed topological graph layout method comprises: Obtaining original data, wherein the original data includes nodes and directed links, and the directed links are used to connect nodes with connection relationships to obtain node links; determining at least one start node among the nodes based on the directed link; Among the plurality of node links starting from the starting node, determining the longest node link, and determining a second long node link, wherein the longest node link includes the first node, The first node has a connection relationship with a second node of the second long node link, and the second node is the starting node of the second long node link; Based on the longest node link, determine the number of first queues in the directed topology graph; Based on the second long node link, determine the second queue number of the directed topology graph, wherein the first queue is set along the first direction, the second queue is set along the second direction, the first direction and the second queue The two directions are at a preset angle; determining the coordinate space of the directed topology graph based on the first number of queues and the second number of queues, and correspondingly positioning the nodes in the coordinate space according to the sort order in the node link; Connect the nodes that have a connection relationship. 2. The directed topological graph layout method according to claim 1, wherein, before the first queue number of the directed topological graph is determined based on the longest node link, the method further comprises: A complex node is determined on the longest node link, wherein the complex node is a node whose number of connection stakes exceeds a threshold value, and the connection stakes are fixed points on the node for realizing the connection between the node and the node. The directed links are connected; The determining the number of first queues in the directed topology graph based on the longest node link specifically includes: determining a first number of said complex nodes; determining a second number of nodes in the longest node link; Based on the first number and the second number, determine a first queue number of the directed topology graph. 3. The directed topological graph layout method according to claim 1, wherein the second queue number of the directed topological graph is determined based on the second long node link, specifically comprising: determining a third number of nodes in the second long node link; Based on the third number, a second queue number of the directed topology graph is determined. 4. The directed topological graph layout method according to claim 1, wherein said placing said nodes in said coordinate space correspondingly according to the sort order in the node link, specifically comprises: Where the first number of complex nodes is greater than zero, placing said longest node link in an intermediate queue of said second queue in said coordinate space; Extract each node in the longest node link, and set the coordinates of the nodes in the intermediate queue according to the sorting order of the nodes in the longest node link, wherein the node's No. The coordinates in one direction are fixed, and the coordinates in the second direction of the node are incremented according to a preset value; determining a second directional coordinate of the second node in the second long node link based on a second directional coordinate of the first node in the longest node link; Setting the second long node link in the target queue of the coordinate space, wherein the target queue is the queue where the second direction coordinate of the second node is located; extract each node in the second long node link, and traverse and set the coordinates of the nodes in the target queue according to the order in which the nodes are arranged in the second long node link, wherein the nodes The coordinates in the second direction of the node are fixed, and the coordinates in the first direction of the node are incremented according to the preset value; extracting remaining nodes, wherein the remaining nodes are nodes other than the node of the longest node link and the node of the second long node link; determining the coordinates of the remaining nodes based on the coordinates of the nodes of the longest node link, or the coordinates of the nodes of the second longest node link; Extracting the free start node, and setting the free start node in the start queue in the first queue in the coordinate space in turn, wherein the free start node is not existing with other nodes The starting node of the connection relationship. 5. The directed topological graph layout method according to claim 4, characterized in that, according to the sorting order of the nodes in the longest node link, traversing and setting the nodes of the intermediate queues coordinates, including: determining the next node of the complex node according to the sort order of the nodes in the longest node link; Compared with the second direction coordinate of the complex node, when the intermediate queue sets the second direction coordinate of the next node of the complex node, it is incremented according to a preset multiple of a preset value. 6. The directed topological graph layout method according to claim 4, wherein the coordinates of the nodes based on the longest node link are determined to determine the coordinates of the remaining nodes, specifically comprising: Determine the first remaining node that has a connection relationship with the node in the longest node link among the remaining nodes, and determine the first remaining node based on the second direction coordinates of the nodes in the longest node link a second direction coordinate of the remaining node; determining a first remaining node link including the first remaining node, wherein a node in the first remaining node link is a node in the remaining node; Setting the first remaining node link in the first remaining node link queue in the coordinate space, wherein the first remaining node link queue is the queue where the second direction coordinates of the first remaining node are located ; Extracting each node in the first remaining node link, and setting the coordinates of the node in the first remaining node link queue according to the arrangement order of the nodes in the first remaining node link, Wherein, the second direction coordinates of the nodes are fixed, and the first direction coordinates of the nodes increase or decrease according to a preset value. 7. The directed topological graph layout method according to claim 4, wherein the coordinates of the nodes based on the second long node link are determined to determine the coordinates of the remaining nodes, specifically comprising: Determine a second remaining node that has a connection relationship with a node in the second long node link among the remaining nodes, and determine the second remaining node based on the first direction coordinates of the nodes in the second long node link The first direction coordinates of the second remaining node; determining a second remaining node link including the second remaining node, wherein a node in the second remaining node link is a node in the remaining node; Setting the second remaining node link in the second remaining node link queue in the coordinate space, wherein the second remaining node link queue is the queue where the first direction coordinates of the second remaining node are located ; Extracting each node in the second remaining node link, and setting the coordinates of the node in the second remaining node link queue according to the arrangement order of the nodes in the second remaining node link , wherein the first direction coordinates of the nodes are fixed, and the second direction coordinates of the nodes increase or decrease according to a preset value. 8. The directed topological graph layout method according to any one of claims 1 to 7, wherein the first direction and the second direction are at a preset angle, specifically comprising: The first direction and the second direction form an angle of 90 degrees, wherein the first direction is the direction indicated by each column of the directed topology map and the second direction is the direction indicated by the directed topology map or the first direction is the direction indicated by the rows of the directed topology map and the second direction is the direction indicated by the columns of the directed topology map. 9. The directed topological graph layout method according to claim 1, wherein the connecting the nodes having a connection relationship specifically comprises: Connecting to the directed link through the connection stake set on the node, and realizing the connection between the node and other nodes having a connection relationship based on the directed link, wherein, The position distribution of the connecting pile on the node is determined in the following manner: determining the number of connection stakes of the node; Based on the preset mapping table, the position distribution of each connection pile on the node in each node is determined, wherein the mapping table includes the corresponding relationship between the number of connection piles and the position distribution of each connection pile on the node, and the connection The piles are evenly distributed on the nodes in a preset position order. 10. A directed topological graph layout device, characterized in that, the directed topological graph layout device comprises: The first module is used to obtain original data, wherein the original data includes nodes and directed links, and the directed links are used to connect nodes with connection relationships to obtain node links; A second module, configured to determine at least one starting node among the nodes based on the directed link; A third module, configured to determine the longest node link among the multiple node links starting from the starting node, and determine a second long node link, wherein the longest node link includes a first node, the first node has a connection relationship with the second node of the second long node link, and the second node is the starting node of the second long node link; A fourth module, configured to determine the number of first queues in the directed topology graph based on the longest node link; The fifth module is configured to determine the second queue number of the directed topology graph based on the second long node link, wherein the first queue is set along the first direction, the second queue is set along the second direction, and the second queue is set along the second direction. A direction and the second direction form a preset angle; The sixth module is configured to determine the coordinate space of the directed topological graph based on the first number of queues and the second number of queues, and place the nodes in corresponding positions according to the sort order in the node link said coordinate space; The seventh module is configured to connect the nodes that have a connection relationship. 11. An electronic device comprising a memory, a processor, and a computer program stored on the memory and operable on the processor, wherein the processor according to claim 1 is implemented when executing the program. The directed topological graph layout method described in any one of to 9. 12. A non-transitory computer-readable storage medium, on which a computer program is stored, characterized in that, when the computer program is executed by a processor, the directed topology graph according to any one of claims 1 to 9 is realized layout method. 13. A computer program product, comprising a computer program, characterized in that, when the computer program is executed by a processor, the directed topology graph layout method according to any one of claims 1 to 9 is implemented.

Images