CN110690997A - Node formatting method, device, equipment and readable storage medium - Google Patents
Node formatting method, device, equipment and readable storage medium Download PDFInfo
- Publication number
- CN110690997A CN110690997A CN201910961074.4A CN201910961074A CN110690997A CN 110690997 A CN110690997 A CN 110690997A CN 201910961074 A CN201910961074 A CN 201910961074A CN 110690997 A CN110690997 A CN 110690997A
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- mesh structure
- child
- values
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 63
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000005516 engineering process Methods 0.000 abstract description 6
- 238000010586 diagram Methods 0.000 description 9
- 238000004891 communication Methods 0.000 description 6
- 230000009286 beneficial effect Effects 0.000 description 2
- 239000008186 active pharmaceutical agent Substances 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000000739 chaotic effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0813—Configuration setting characterised by the conditions triggering a change of settings
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0893—Assignment of logical groups to network elements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/22—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks comprising specially adapted graphical user interfaces [GUI]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/02—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Human Computer Interaction (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to the field of financial science and technology, and discloses a node formatting method, a device, equipment and a readable storage medium, wherein the method comprises the following steps: traversing all nodes in a front-end mesh structure to obtain a father node and a child node of the front-end mesh structure; respectively calculating the hierarchy values of the father node and the child nodes, and determining the connection mode of the front-end mesh structure; if the connection mode is the non-cross-level connection, placing the father node and the child nodes based on the non-cross-level connection; and if the connection mode is cross-level connection, placing the father node and the child nodes based on the cross-level connection. The invention carries out one-key formatting on the complex mesh structure in different connection modes by distinguishing the connection modes, and clearly places all the nodes on the page under the condition of keeping the interrelation of all the nodes in the mesh structure unchanged, so that a user can visually see the relationship among the nodes to carry out new operation.
Description
Technical Field
The invention relates to the technical field of financial technology (Fintech), in particular to a node formatting method, a device, equipment and a readable storage medium in the financial industry.
Background
With the development of computer technology, more and more technologies (such as distributed, WEB front end, artificial intelligence, etc.) are applied to the financial field, the traditional financial industry is gradually changing to financial technology (Fintech), and more technologies are applied to the financial industry. Developers in the financial industry usually use a WEB front end to develop, when nodes are too many, the phenomena of node stacking and node superposition on a page are easily caused, so that a user cannot visually see the relationship between the nodes, and new operation is difficult to perform.
Disclosure of Invention
The invention mainly aims to provide a node formatting method, a node formatting device, a node formatting equipment and a readable storage medium, and aims to solve the problem that in the prior art, when too many nodes are arranged at the front end of WEB, page nodes are stacked and overlapped, so that a user cannot visually see the relationship between the nodes.
In order to achieve the above object, the present invention provides a node formatting method, including the steps of:
traversing all nodes in a front-end mesh structure to obtain a father node and a child node of the front-end mesh structure;
respectively calculating the hierarchy values of the father node and the child nodes, and determining the connection mode of the front-end mesh structure;
if the connection mode is the non-cross-level connection, placing the father node and the child nodes based on the non-cross-level connection;
and if the connection mode is cross-level connection, placing the father node and the child nodes based on the cross-level connection.
Optionally, the step of respectively performing level value calculation on the parent node and the child node, and determining the connection mode of the front-end mesh structure includes:
acquiring all nodes of any one mesh structure, and determining an initial node of the mesh structure when no father node exists in any node;
setting level values for a first child node of the starting node and a second child node of the first child node in sequence from the starting node, wherein the level values of the first child node and the second child node are in an increasing relationship;
if each node only has a unique level value, judging that the connection mode of the front-end network structure is non-cross-level connection;
and if a plurality of nodes with different hierarchy values exist in all the nodes, judging that the connection mode of the front-end mesh structure is cross-level connection.
Optionally, if the connection mode is a non-cross-level connection, the step of placing the parent node and the child node based on the non-cross-level connection includes:
acquiring hierarchy values respectively corresponding to all nodes of the front-end network structure;
separately placing corresponding nodes with different hierarchical values to obtain a first starting node with the hierarchical value as the initial hierarchy;
acquiring all nodes of a mesh structure to which the first starting node belongs based on the first starting node until all nodes of all mesh structures are extracted to obtain one or more mutually independent mesh structures;
and (4) setting coordinates of the nodes in each reticular structure and then placing the nodes.
Optionally, the step of placing the nodes in each mesh structure after setting the coordinates includes:
selecting a first mesh structure from the front-end mesh structures;
acquiring a second starting node corresponding to the first mesh structure, and traversing from the second starting node to acquire hierarchy values corresponding to all nodes in the first mesh structure;
selecting a layer with the maximum number of nodes in the hierarchy values as a reference and setting a first coordinate value of each node based on the hierarchy values corresponding to all nodes in the first mesh structure;
selecting a second mesh structure from the front-end mesh structure as a first mesh structure, and executing acquisition of a second initial node corresponding to the first mesh structure until the corresponding coordinate values of all nodes of each mesh structure in the front-end mesh structure are set;
and placing according to the corresponding coordinate values of the nodes.
Optionally, if the connection mode is cross-level connection, the step of placing the parent node and the child node based on the cross-level connection includes:
determining a first node in all nodes, and setting a second coordinate value of the first node;
traversing from the first node to obtain second nodes, wherein the second nodes are all father nodes and all child nodes of the first node;
judging whether the path from the first node to the second node is unique or not;
if so, setting a third coordinate value of the second node based on the second coordinate value;
taking the second node as the first node, and continuing to execute the step of traversing from the first node to obtain the second node until the coordinate value setting of all the nodes is completed;
and converting the second coordinate value and the third coordinate value into real values and placing the real values on a page.
Optionally, after the step of determining whether the path from the first node to the second node is unique, the node formatting method includes:
and if the path from the first node to the second node has a plurality of paths, traversing all father nodes and child nodes of the second node until the first node returns to continue traversing the rest father nodes and child nodes of the first node.
Optionally, if the connection mode is a cross-level connection, after the step of placing the parent node and the child node based on the cross-level connection, the node formatting method includes:
outputting a node parameter setting interface when a formatting command is received;
and when receiving a setting instruction generated by triggering the node parameter setting interface, setting parameters of all nodes based on the setting instruction.
In addition, to achieve the above object, the present invention provides a node formatting apparatus, including:
the acquisition module is used for traversing all nodes in the front-end mesh structure to acquire a father node and a child node of the front-end mesh structure;
the determining module is used for respectively calculating the hierarchical values of the father node and the child nodes and determining the connection mode of the front-end network structure;
the first placing module is used for placing the father node and the child nodes based on the non-cross-level connection if the connection mode is the non-cross-level connection;
and the second placing module is used for placing the father node and the child nodes based on the cross-level connection if the connection mode is the cross-level connection.
Optionally, the determining module is further configured to:
acquiring all nodes of any one mesh structure, and determining an initial node of the mesh structure when no father node exists in any node;
setting level values for a first child node of the starting node and a second child node of the first child node in sequence from the starting node, wherein the level values of the first child node and the second child node are in an increasing relationship;
if each node only has a unique level value, judging that the connection mode of the front-end network structure is non-cross-level connection;
and if a plurality of nodes with different hierarchy values exist in all the nodes, judging that the connection mode of the front-end mesh structure is cross-level connection.
Optionally, the first placing module is further configured to:
acquiring hierarchy values respectively corresponding to all nodes of the front-end network structure;
separately placing corresponding nodes with different hierarchical values to obtain a first starting node with the hierarchical value as the initial hierarchy;
acquiring all nodes of a mesh structure to which the first starting node belongs based on the first starting node until all nodes of all mesh structures are extracted to obtain one or more mutually independent mesh structures;
and (4) setting coordinates of the nodes in each reticular structure and then placing the nodes.
Optionally, the first placing module is further configured to:
selecting a first mesh structure from the front-end mesh structures;
acquiring a second starting node corresponding to the first mesh structure, and traversing from the second starting node to acquire hierarchy values corresponding to all nodes in the first mesh structure;
selecting a layer with the maximum number of nodes in the hierarchy values as a reference and setting a first coordinate value of each node based on the hierarchy values corresponding to all nodes in the first mesh structure;
selecting a second mesh structure from the front-end mesh structure as a first mesh structure, and executing acquisition of a second initial node corresponding to the first mesh structure until the corresponding coordinate values of all nodes of each mesh structure in the front-end mesh structure are set;
and placing according to the corresponding coordinate values of the nodes.
Optionally, the second placing module is further configured to:
determining a first node in all nodes, and setting a second coordinate value of the first node;
traversing from the first node to obtain second nodes, wherein the second nodes are all father nodes and all child nodes of the first node;
judging whether the path from the first node to the second node is unique or not;
if so, setting a third coordinate value of the second node based on the second coordinate value;
taking the second node as the first node, and continuing to execute the step of traversing from the first node to obtain the second node until the coordinate value setting of all the nodes is completed;
and converting the second coordinate value and the third coordinate value into real values and placing the real values on a page.
In addition, to achieve the above object, the present invention further provides a node formatting device, including: a memory, a processor, and a node formatter stored on the memory and executable on the processor, the node formatter when executed by the processor implementing the steps of the node formatting method as described above.
In addition, to achieve the above object, the present invention further provides a readable storage medium having stored thereon a node formatting program, which when executed by a processor implements the steps of the node formatting method as described above.
The node formatting method provided by the invention is characterized in that all father nodes and child nodes of the front-end mesh structure are obtained by traversing all nodes in the front-end mesh structure, and the level value of each node is calculated to determine the connection mode of the front-end mesh structure; when the connection mode is non-cross-level connection, the father node and the son nodes are placed based on the non-cross-level connection; and when the connection mode is cross-level connection, the father node and the son nodes are placed based on the cross-level connection. Through distinguishing the connection mode, one-key formatting of different connection modes is carried out on a complex mesh structure, all nodes are clearly placed on a page under the condition that the mutual relation of all nodes in the mesh structure is kept unchanged, and therefore a user can visually see the relation between the nodes to carry out new operation.
Drawings
FIG. 1 is a schematic diagram of an apparatus architecture of a hardware operating environment according to an embodiment of the present invention;
FIG. 2 is a flowchart illustrating a node formatting method according to a first embodiment of the present invention;
FIG. 3 is a schematic structural diagram of a node formatting method of the present invention without cross-level connection;
FIG. 4 is a schematic structural diagram of a node formatting method according to the present invention with a cross-level connection mode;
FIG. 5 is a flowchart illustrating a node formatting method according to a second embodiment of the present invention;
FIG. 6 is a schematic structural diagram of a node formatting method according to the present invention before formatting;
FIG. 7 is a schematic structural diagram of a node formatting method according to the present invention;
FIG. 8 is a flowchart illustrating a node formatting method according to a third embodiment of the present invention;
FIG. 9 is a parameter setting interface diagram of the node formatting method of the present invention;
FIG. 10 is a schematic structural diagram of the node formatting method of the present invention after setting the node width;
FIG. 11 is a diagonal line connection diagram of the node formatting method of the present invention.
The implementation, functional features and advantages of the objects of the present invention will be further explained with reference to the accompanying drawings.
Detailed Description
It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
As shown in fig. 1, fig. 1 is a schematic device structure diagram of a hardware operating environment according to an embodiment of the present invention.
The node formatting equipment of the embodiment of the invention can be a PC or server equipment.
As shown in fig. 1, the node formatting apparatus may include: a processor 1001, such as a CPU, a network interface 1004, a user interface 1003, a memory 1005, a communication bus 1002. Wherein a communication bus 1002 is used to enable connective communication between these components. The user interface 1003 may include a Display screen (Display), an input unit such as a Keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface, a wireless interface. The network interface 1004 may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface). The memory 1005 may be a high-speed RAM memory or a non-volatile memory (e.g., a magnetic disk memory). The memory 1005 may alternatively be a storage device separate from the processor 1001.
Those skilled in the art will appreciate that the configuration of the apparatus shown in fig. 1 is not intended to be limiting of the apparatus and may include more or fewer components than those shown, or some components may be combined, or a different arrangement of components.
As shown in fig. 1, a memory 1005, which is a kind of computer-readable storage medium, may include therein an operating system, a network communication module, a user interface module, and a node formatting program.
In the device shown in fig. 1, the network interface 1004 is mainly used for connecting to a backend server and performing data communication with the backend server; the user interface 1003 is mainly used for connecting a client and performing data communication with the client; and the processor 1001 may be configured to invoke the node formatting program stored in the memory 1005 and perform the operations in the various embodiments of the node formatting method described below.
Based on the hardware structure, the embodiment of the node formatting method is provided.
In the prior art, a method for formatting a front-end visible complex mesh structure does not exist, only a method for formatting nodes of a front-end visible tree structure is realized by recursively formatting each node, but because the hierarchical relationship of the nodes of the tree structure is simple, each node is recursively formatted only, and the formatting requirement of the mesh structure cannot be met.
Referring to fig. 2, fig. 2 is a schematic flow chart of a first embodiment of a node formatting method according to the present invention, where the method includes:
step S10, traversing all nodes in the front-end mesh structure to obtain a father node and a child node of the front-end mesh structure;
in this embodiment, the front-end mesh structure refers to each mesh structure included in a WEB front end, where the WEB front end, for example, vue.
Js is a progressive framework for building user interfaces. Unlike other heavyweight frames, Vue employs a design developed in bottom-up increments. Js is aimed at implementing responsive data binding and assembly of view components through as simple APIs as possible, and is not itself a full-featured framework, focusing only on the view layer.
However, when a user uses a WEB front end, the user often needs to generate nodes on a page through operations such as dragging, copying, pasting and the like, the nodes are connected through a connecting line to form one or more complex mesh structures, and the requirement of the connecting line between the nodes can be that one node can be connected with any plurality of nodes; or one node may be connected by any number of nodes; or at most one line can be connected between the two nodes; or two or more nodes cannot be connected in a ring. However, when the number of nodes is too many, the phenomenon of node stacking and overlapping occurs on the page arbitrarily, so that the user cannot visually see the relationship between the nodes, and new operation is difficult to perform.
In the scheme, all nodes in the front-end mesh structure are traversed to obtain all father nodes and child nodes of the front-end mesh structure. As shown in fig. 3, according to the connection direction, for example, the current arrow points from the node a to the node B, which means that the current node a is the parent node of the node B, the node B is the child node of the node a, and if the node a has no parent node, it can be determined that the node a is the starting node in the mesh structure where the node a is located.
All father nodes and all child nodes are obtained by traversing all nodes in the front-end mesh structure, so that the connection mode of the front-end mesh structure is determined by judging the father nodes and the child nodes.
Step S20, respectively carrying out level value calculation on the father node and the child nodes, and determining the connection mode of the front-end mesh structure;
in this step, after all the father nodes and the child nodes of the front-end mesh structure are obtained, the level values of the father nodes and the child nodes are calculated, and the connection mode of the front-end mesh structure is determined.
It should be noted that the front mesh structure may include one or more mesh structures.
Performing hierarchical value calculation on a father node and a child node, mainly performing hierarchical value calculation on all nodes of the front-end network structure, specifically: acquiring all nodes of any one mesh structure, and determining any node as an initial node of the mesh structure when no father node exists in the any node; setting level values for a first child node of the starting node and a second child node of the first child node in sequence from the starting node, wherein the level values of the first child node and the second child node are in an increasing relationship; if each node only has a unique level value, judging that the connection mode of the front-end network structure is non-cross-level connection; and if a plurality of nodes with different hierarchy values exist in all the nodes, judging that the connection mode of the front-end mesh structure is cross-level connection.
Specifically, after all the parent nodes and the child nodes are obtained, if a certain parent node is a node without a parent node, it may be determined that the node is an initial node of a mesh structure, at this time, a level value is set for each node from the initial node, for example, if the level value level of the initial node a is 1, the level value level of the child node B is 2, the child node B is a parent node of the child node C, the level value level of the node C is 3, and so on, after the level values corresponding to all the nodes are set, if all the nodes are found to have only one unique level value, it is said that the connection mode of the mesh structure is more standard, which is called as cross-level-free connection, that is, a parent node is connected with one or more child nodes, and the child nodes are further connected with one or more child nodes, and there is no need to connect other child nodes than the child nodes, the child nodes of the child nodes are also connected, and the method belongs to a non-cross-stage connection mode.
When a certain node has a plurality of different hierarchical values, it is shown that the mesh structure is complex, as shown in fig. 4, node a is a parent node of node B, node B is a parent node of node C, and meanwhile, node a is also a parent node of node C, and at this time, the connection mode belongs to a cross-level connection.
After the connection mode is determined, nodes are placed in different connection modes in a targeted mode, so that all the nodes are clearly placed on a page.
Step S30, if the connection mode is non-cross-level connection, placing the father node and the child nodes based on the non-cross-level connection;
in this step, when it is determined that the connection mode is the non-cross-level connection, the parent node and the child node are placed based on the non-cross-level connection.
The placing mode aiming at the stepless connection is as follows: acquiring hierarchy values respectively corresponding to all nodes of the front-end network structure; the corresponding nodes with different level values are placed in different layers, so that a first starting node with the level value as the initial level is obtained; acquiring all nodes of a mesh structure to which the first starting node belongs based on the first starting node until all nodes of all mesh structures are extracted to obtain one or more mutually independent mesh structures; and (4) setting coordinates of the nodes in each reticular structure and then placing the nodes.
More specifically, since each node has only a unique level value in the non-cross-level connection manner, the nodes with different level values need to be placed in different layers, and the level values include a first layer, a second layer, and a third layer … …, obviously, the initial level is the first layer, and the corresponding node is the start node, so as to obtain the first start node with the level value corresponding to the initial level; then, based on the first starting node, all nodes of the mesh structure to which the first starting node belongs are obtained until all nodes of all mesh structures are extracted, and one or more mutually independent mesh structures are obtained; and finally, setting coordinates of the nodes in each reticular structure and placing the nodes.
It should be noted that, when the nodes of different levels are separately placed, the nodes of the same level are placed together, for example, the nodes of the same level are all placed horizontally, so as to be separated from the nodes of different levels, which is beneficial to quickly finding the starting node.
When the connection mode is determined to be the non-cross-level connection, each node is placed according to the non-cross-level connection, and the method is efficient and simple.
And step S40, if the connection mode is cross-level connection, placing the father node and the son nodes based on the cross-level connection.
In this step, when it is determined that the connection mode is cross-level connection, the parent node and the child node are placed based on the cross-level connection.
The specific placing mode aiming at the cross-level connection is as follows: determining a first node in all nodes, and setting a second coordinate value of the first node; traversing from the first node to obtain all father nodes and child nodes of the first node; when the father node or the child node of the first node is determined to be a second node, judging whether a path from the first node to the second node is unique; if so, setting a third coordinate value of the second node based on the second coordinate value; until the coordinate values of all nodes are set; and converting the second coordinate value, the third coordinate value and the fifth coordinate value into a true value and placing the true value on a page.
More specifically, the first node may be any one of all nodes, after the first node is determined, a second coordinate value of the first node is set, where the second coordinate value may be set to (0,0), then, when traversing all parent nodes and child nodes of the first node from the first node, for example, traversing a child node of node a or a parent node B, searching whether there are other paths from node a to node B, if there are any paths, indicating that node a and node B may not be nodes of two adjacent hierarchies, temporarily not setting the coordinate x value and the y value of node B, first setting the x value and the y value for nodes of adjacent hierarchies of node a, and so on, and finally implementing the setting of the x value and the y value in node B; if not, setting the x value and the y value of the node B according to the x value and the y value of the node A, namely setting coordinates, specifically, determining the node widths and the node intervals of two adjacent nodes, and setting the x value and the y value of the node B by combining the node widths and the node intervals of the two nodes under the condition of the x value and the y value of the node A until the coordinate values of all the nodes are set.
When the connection mode is cross-level connection, the formatting can be performed through a node formatting method when the connection mode is cross-level connection, compared with the connection mode without cross-level connection, more calculation is needed, the data structure of each node level is effectively distinguished, and the specific arrangement can be determined according to requirements.
Under two conditions, other node placing forms can be selected to be adopted at last, if the nodes are not symmetrically placed according to the central axis of the longest row, the left-side alignment or the right-side alignment is changed, the key is that the data structure for distinguishing the node levels is obtained, and the specific placing can be determined according to requirements.
It should be noted that, during the operation of each step, the current state of each step is recorded, and regardless of how many times the subsequent formatting is performed, the recovery can be performed once and again until the state before the first formatting is recovered.
The node formatting method provided by the invention is characterized in that all father nodes and child nodes of the front-end mesh structure are obtained by traversing all nodes in the front-end mesh structure, and the level value of each node is calculated to determine the connection mode of the front-end mesh structure; when the connection mode is non-cross-level connection, the father node and the son nodes are placed based on the non-cross-level connection; and when the connection mode is cross-level connection, the father node and the son nodes are placed based on the cross-level connection. Through distinguishing the connection mode, one-key formatting of different connection modes is carried out on a complex mesh structure, all nodes are clearly placed on a page under the condition that the mutual relation of all nodes in the mesh structure is kept unchanged, and therefore a user can visually see the relation between the nodes to carry out new operation.
Further, based on the first embodiment of the node formatting method of the present invention, a second embodiment of the node formatting method of the present invention is proposed; as shown in fig. 5, step S30 may include:
step S31, acquiring the level values corresponding to all the nodes of the front-end network structure respectively;
step S32, separately placing corresponding nodes with different level values to obtain a first starting node with the level value as the initial level;
step S33, acquiring all nodes of the mesh structure to which the first start node belongs based on the first start node until all nodes of all mesh structures are extracted to obtain one or more mutually independent mesh structures;
and step S34, setting coordinates of the nodes in each mesh structure and then placing the nodes.
In this embodiment, when it is determined that the connection mode is the cross-level-free connection, first, level values corresponding to all nodes of the front-end mesh structure are obtained, and then corresponding nodes with different level values are separately placed to obtain a first starting node corresponding to the level value as an initial level; then, based on the first starting node, all nodes of the mesh structure to which the first starting node belongs are obtained until all nodes of all mesh structures are extracted to obtain one or more mutually independent mesh structures, and finally, the nodes in each mesh structure are placed after coordinate setting.
Since each node has a unique level value, it is necessary to separately place nodes with different level values to obtain a node corresponding to an initial level, i.e., to obtain an initial node, where the level values include a first level, a second level, and a third level … …, obviously, the initial level is the first level, and the corresponding node is the initial node, so as to obtain a first initial node with a level value corresponding to the initial level; then, based on the first starting node, all nodes of the mesh structure to which the first starting node belongs are obtained until all nodes of all mesh structures are extracted, and one or more mutually independent mesh structures are obtained; and finally, setting coordinates of the nodes in each reticular structure and placing the nodes.
It should be noted that, when the nodes of different levels are separately placed, the nodes of the same level are placed together, for example, the nodes of the same level are all placed horizontally, so as to be separated from the nodes of different levels, which is beneficial to quickly finding the starting node.
And finally, carrying out coordinate setting on all nodes in all the mesh structures without the cross-stage connection mode in the front-end mesh structure so as to display the position on the page.
Further, step S34 may include:
selecting a first mesh structure from the front-end mesh structures;
acquiring a second starting node corresponding to the first mesh structure, and traversing from the second starting node to acquire hierarchy values corresponding to all nodes in the first mesh structure;
selecting a layer with the maximum number of nodes in the hierarchy values as a reference and setting a first coordinate value of each node based on the hierarchy values corresponding to all nodes in the first mesh structure;
selecting a second mesh structure from the front-end mesh structure as a first mesh structure, and executing acquisition of a second initial node corresponding to the first mesh structure until the corresponding coordinate values of all nodes of each mesh structure in the front-end mesh structure are set;
and placing according to the corresponding coordinate values of the nodes.
In this embodiment, the placing after the coordinate setting is performed on the nodes in each mesh structure specifically is as follows: selecting a first mesh structure from the front-end mesh structures; acquiring a second starting node corresponding to the first mesh structure, and traversing from the second starting node to acquire hierarchy values corresponding to all nodes in the first mesh structure; selecting a layer with the maximum number of nodes in the hierarchy values as a reference and setting a first coordinate value of each node based on the hierarchy values corresponding to all nodes in the first mesh structure; selecting a second mesh structure from the front-end mesh structure as a first mesh structure, and executing acquisition of a second initial node corresponding to the first mesh structure until the corresponding coordinate values of all nodes of each mesh structure in the front-end mesh structure are set; and placing according to the corresponding coordinate values of the nodes.
Specifically, firstly, any one of the mesh structures is selected as a first mesh structure, and traversal is started from the first mesh structure; then, since it is known that each node has a unique level value, it can be known which level has the largest number of nodes in the current mesh structure, the x and y attribute values of all nodes of the layer are set first by taking the layer as a reference for placement, and other layers are symmetrically placed according to the central axis of the layer. Referring to fig. 6, before formatting, the formatting is complicated and chaotic, and after formatting, as shown in fig. 7, after formatting, it is obvious that 9 nodes of the first layer, 7 nodes of the second layer, 7 nodes of the third layer, 8 nodes of the fourth layer, 7 nodes of the fifth layer, … … nodes of the fifth layer are obvious, and the number of nodes of the first layer is the largest, so that the first layer is taken as a reference for placement, all nodes of the layer are placed first, and x values and y values of all nodes of the first layer are set, that is, a first coordinate value is set.
It should be noted that, in fig. 6, each node has a unique level value, so that the level with the largest number of nodes can be known, and the level with the largest number of nodes is placed in the first level in fig. 7.
Then, knowing the number of nodes in the layer with the most nodes, knowing the width (set by the user during formatting) and height (system definition) of the nodes, knowing the gap (system definition) between the nodes, knowing the starting x and y values of the layer (if this is the first mesh, the starting x and y values are defined by the system, if this is not the first mesh, the starting x and y values are calculated from the relevant properties of the previously laid mesh), the x and y values of each node in the layer can be calculated, as well as the x value of the central axis of this mesh, and the starting x and y values of the next mesh. Taking fig. 7 as an example, all the nodes of the first layer are placed with the central axis of the first layer as a reference, that is, all the nodes of the first layer are placed with the fifth node of the first layer as the central axis.
And, assuming that the coordinate value of the fifth node of the first layer is set to be (5, y), the coordinate values of the nodes of all the layers are set by the same method by using the fourth node as the central axis and setting the coordinate values to be (5, y-1) and so on, so that all the nodes of a mesh structure are set.
After all nodes of one mesh have set the x and y values, the x and y values of all nodes of the next mesh are set until all nodes on the page have set the x and y values.
And placing the nodes on the page according to the x and y values of the nodes, thereby completing the placement of all the nodes of the whole mesh structure.
Because the mode of the stepless connection is simpler, when the node is placed, the level of the most nodes is determined firstly, and the coordinates are set, so that the coordinates of each node of each layer are obtained, and the method is simple and easy to implement.
Further, based on the first embodiment of the node formatting method of the present invention, a third embodiment of the node formatting method of the present invention is proposed; as shown in fig. 8, step S40 may include:
step S41, determining a first node in all nodes, and setting a second coordinate value of the first node;
step S42, traversing from the first node to obtain a second node, wherein the second node is all father nodes and all child nodes of the first node;
step S43, judging whether the path from the first node to the second node is unique;
step S44, if yes, setting a third coordinate value of the second node based on the second coordinate value;
step S45, regarding the second node as the first node, and continuing to execute the step of starting traversal from the first node to acquire the second node until the coordinate value setting of all nodes is completed;
step S46, converting the second coordinate value and the third coordinate value into a true value, and placing the true value on a page.
Further, after the step of determining whether the path from the first node to the second node is unique, the node formatting method includes:
step S47, if there are multiple paths from the first node to the second node, traversing all the father nodes and the children nodes of the second node until returning to the first node to continue traversing the remaining father nodes and children nodes of the first node.
In this embodiment, when it is determined that the connection mode is cross-level connection, it indicates that the mesh structure is relatively complex, and at this time, a first node is determined in all nodes, where the first node may be any one of all nodes, after the first node is determined, a second coordinate value of the first node is set, the second coordinate value may be set to (0,0), then, when traversing all the parent nodes and the child nodes of the first node from the first node, for example, traversing the child node of the node A or the parent node B, searching whether other paths from the node A to the node B exist, if so, indicating that the node A and the node B are not nodes of two adjacent levels, temporarily not setting the coordinate x value and the coordinate y value of the node B, firstly setting the x value and the coordinate y value of the node of the adjacent level of the node A, and then repeating the steps, and finally realizing the setting of the x value and the coordinate y value in the node B; if not, setting the x value and the y value of the node B according to the x value and the y value of the node A until the coordinate values of all nodes are set, thereby obtaining the node setting of other mesh structures.
Because the coordinate values set are all relative values, not real coordinate values on the corresponding page, the coordinate values are converted into real values according to parameter attributes such as node width, node interval and the like, and are placed on the page.
Different from the non-cross-level connection mode, when the nodes are placed in the non-cross-level connection mode, each node has a unique level value, and the nodes of different levels can be distinguished through the level values; in the cross-level connection mode, although each node has no unique level value, but has a unique y value, in the same mesh structure, the nodes with the same y value are placed in the same row, just like the nodes without the cross-level connection have the same level value.
Aiming at the connection mode with more complicated cross-level connection, the mode of distinguishing non-cross-level connection is adopted for processing, so that the node placement with the cross-level connection mode is effectively realized, and each node can be clearly placed on a page for a user to drag, copy and the like.
Further, after step S40, the node formatting method may further include:
outputting a node parameter setting interface when a formatting command is received;
and when receiving a setting instruction generated by triggering the node parameter setting interface, setting parameters of all nodes based on the setting instruction.
In this embodiment, the node parameters may include parameters such as node width, node interval, connection style, and the like, and the user may select the formatted node width, node interval, and connection style.
As shown in fig. 9, the node parameter setting interface includes a line/oblique line selection button and a node width setting button, and the user can select the line/oblique line and the node width setting; for the mesh structure of fig. 7, after the node width is changed from 150 to 80, the mesh structure shown in fig. 10 is obtained.
Of course, the user may also select the connection mode, which is a straight line or a diagonal line, and modify the straight line connection mode of fig. 9 into the diagonal line mode to obtain the connection mode shown in fig. 11.
By providing node parameter setting for the user, the user can set response parameters according to the requirements of the user, so that the user can conveniently check the nodes on the page and the like.
The invention also provides a node formatting device. The node formatting device of the present invention comprises:
the acquisition module is used for traversing all nodes in the front-end mesh structure to acquire a father node and a child node of the front-end mesh structure;
the determining module is used for respectively calculating the hierarchical values of the father node and the child nodes and determining the connection mode of the front-end network structure;
the first placing module is used for placing the father node and the child nodes based on the non-cross-level connection if the connection mode is the non-cross-level connection;
and the second placing module is used for placing the father node and the child nodes based on the cross-level connection if the connection mode is the cross-level connection.
Further, the determining module is further configured to:
acquiring all nodes of any one mesh structure, and determining an initial node of the mesh structure when no father node exists in any node;
setting level values for a first child node of the starting node and a second child node of the first child node in sequence from the starting node, wherein the level values of the first child node and the second child node are in an increasing relationship;
if each node only has a unique level value, judging that the connection mode of the front-end network structure is non-cross-level connection;
and if a plurality of nodes with different hierarchy values exist in all the nodes, judging that the connection mode of the front-end mesh structure is cross-level connection.
Further, the first placing module is further configured to:
acquiring hierarchy values respectively corresponding to all nodes of the front-end network structure;
separately placing corresponding nodes with different hierarchical values to obtain a first starting node with the hierarchical value as the initial hierarchy;
acquiring all nodes of a mesh structure to which the first starting node belongs based on the first starting node until all nodes of all mesh structures are extracted to obtain one or more mutually independent mesh structures;
and (4) setting coordinates of the nodes in each reticular structure and then placing the nodes.
Further, the first placing module is further configured to:
selecting a first mesh structure from the front-end mesh structures;
acquiring a second starting node corresponding to the first mesh structure, and traversing from the second starting node to acquire hierarchy values corresponding to all nodes in the first mesh structure;
selecting a layer with the maximum number of nodes in the hierarchy values as a reference and setting a first coordinate value of each node based on the hierarchy values corresponding to all nodes in the first mesh structure;
selecting a second mesh structure from the front-end mesh structure as a first mesh structure, and executing acquisition of a second initial node corresponding to the first mesh structure until the corresponding coordinate values of all nodes of each mesh structure in the front-end mesh structure are set;
and placing according to the corresponding coordinate values of the nodes.
Further, the second placing module is further configured to:
determining a first node in all nodes, and setting a second coordinate value of the first node;
traversing from the first node to obtain second nodes, wherein the second nodes are all father nodes and all child nodes of the first node;
judging whether the path from the first node to the second node is unique or not;
if so, setting a third coordinate value of the second node based on the second coordinate value;
taking the second node as the first node, and continuing to execute the step of traversing from the first node to obtain the second node until the coordinate value setting of all the nodes is completed;
and converting the second coordinate value and the third coordinate value into real values and placing the real values on a page.
Optionally, the second placing module is further configured to:
and if the path from the first node to the second node has a plurality of paths, traversing all father nodes and child nodes of the second node until the first node returns to continue traversing the rest father nodes and child nodes of the first node.
Optionally, the node formatting apparatus further includes a setting module, configured to:
outputting a node parameter setting interface when a formatting command is received;
and when receiving a setting instruction generated by triggering the node parameter setting interface, setting parameters of all nodes based on the setting instruction.
The invention also provides a computer readable storage medium.
The computer readable storage medium of the present invention has stored thereon a node formatting program which, when executed by a processor, implements the steps of the node formatting method as described above.
The method implemented when the node formatting program running on the processor is executed may refer to each embodiment of the node formatting method of the present invention, and details are not described here.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or system that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or system. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or system that comprises the element.
The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner. Based on such understanding, the technical solution of the present invention may be substantially or partially embodied in the form of a software product, which is stored in a readable storage medium (such as ROM/RAM, magnetic disk, optical disk) as described above and includes instructions for enabling a node formatting device (such as a mobile phone, a computer, a server, an air conditioner, or a network device) to execute the method according to the embodiments of the present invention.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (14)
1. A node formatting method, comprising the steps of:
traversing all nodes in a front-end mesh structure to obtain a father node and a child node of the front-end mesh structure;
respectively calculating the hierarchy values of the father node and the child nodes, and determining the connection mode of the front-end mesh structure;
if the connection mode is the non-cross-level connection, placing the father node and the child nodes based on the non-cross-level connection;
and if the connection mode is cross-level connection, placing the father node and the child nodes based on the cross-level connection.
2. The node formatting method according to claim 1, wherein said step of performing level value calculation on said parent node and said child node respectively, and determining a connection mode of said front-end mesh structure comprises:
acquiring all nodes of any one mesh structure, and determining an initial node of the mesh structure when no father node exists in any node;
setting level values for a first child node of the starting node and a second child node of the first child node in sequence from the starting node until the level values of all nodes are set; the hierarchical value of the first child node and the hierarchical value of the second child node are in an increasing relationship;
if each node only has a unique level value, judging that the connection mode of the front-end network structure is non-cross-level connection;
and if a plurality of nodes with different hierarchy values exist in all the nodes, judging that the connection mode of the front-end mesh structure is cross-level connection.
3. The node formatting method according to claim 1, wherein if the connection mode is non-cross-level connection, the step of placing the parent node and the child node based on the non-cross-level connection comprises:
acquiring hierarchy values respectively corresponding to all nodes of the front-end network structure;
separately placing corresponding nodes with different hierarchical values to obtain a first starting node with the hierarchical value as the initial hierarchy;
acquiring all nodes of a mesh structure to which the first starting node belongs based on the first starting node until all nodes of all mesh structures are extracted to obtain one or more mutually independent mesh structures;
and (4) setting coordinates of the nodes in each reticular structure and then placing the nodes.
4. The node formatting method of claim 3, wherein said step of coordinate setting and post-positioning nodes in each mesh structure comprises:
selecting a first mesh structure from the front-end mesh structures;
acquiring a second starting node corresponding to the first mesh structure, and traversing from the second starting node to acquire hierarchy values corresponding to all nodes in the first mesh structure;
selecting a layer with the maximum number of nodes in the hierarchy values as a reference and setting a first coordinate value of each node based on the hierarchy values corresponding to all nodes in the first mesh structure;
selecting a second mesh structure from the front-end mesh structure as a first mesh structure, and executing acquisition of a second initial node corresponding to the first mesh structure until the corresponding coordinate values of all nodes of each mesh structure in the front-end mesh structure are set;
and placing according to the corresponding coordinate values of the nodes.
5. The node formatting method according to claim 1, wherein if the connection mode is a cross-level connection, the step of placing the parent node and the child node based on the cross-level connection comprises:
determining a first node in all nodes, and setting a second coordinate value of the first node;
traversing from the first node to obtain second nodes, wherein the second nodes are all father nodes and all child nodes of the first node;
judging whether the path from the first node to the second node is unique or not;
if so, setting a third coordinate value of the second node based on the second coordinate value;
taking the second node as the first node, and continuing to execute the step of traversing from the first node to obtain the second node until the coordinate value setting of all the nodes is completed;
and converting the second coordinate value and the third coordinate value into real values and placing the real values on a page.
6. The node formatting method of claim 5, wherein after said step of determining whether the path from the first node to the second node is unique, the node formatting method comprises:
and if the path from the first node to the second node has a plurality of paths, traversing all father nodes and child nodes of the second node until the first node returns to continue traversing the rest father nodes and child nodes of the first node.
7. The node formatting method according to any one of claims 1 to 6, wherein after the step of placing the parent node and the child node based on the connection mode is a connection with a cross level, the node formatting method comprises:
outputting a node parameter setting interface when a formatting command is received;
and when receiving a setting instruction generated by triggering the node parameter setting interface, setting parameters of all nodes based on the setting instruction.
8. A node formatting apparatus, comprising:
the acquisition module is used for traversing all nodes in the front-end mesh structure to acquire a father node and a child node of the front-end mesh structure;
the determining module is used for respectively calculating the hierarchical values of the father node and the child nodes and determining the connection mode of the front-end network structure;
the first placing module is used for placing the father node and the child nodes based on the non-cross-level connection if the connection mode is the non-cross-level connection;
and the second placing module is used for placing the father node and the child nodes based on the cross-level connection if the connection mode is the cross-level connection.
9. The node formatting apparatus of claim 8, wherein the determining module is further to:
acquiring all nodes of any one mesh structure, and determining an initial node of the mesh structure when no father node exists in any node;
setting level values for a first child node of the starting node and a second child node of the first child node in sequence from the starting node, wherein the level values of the first child node and the second child node are in an increasing relationship;
if each node only has a unique level value, judging that the connection mode of the front-end network structure is non-cross-level connection;
and if a plurality of nodes with different hierarchy values exist in all the nodes, judging that the connection mode of the front-end mesh structure is cross-level connection.
10. The node formatting apparatus of claim 8, wherein the first placer module is further configured to:
acquiring hierarchy values respectively corresponding to all nodes of the front-end network structure;
separately placing corresponding nodes with different hierarchical values to obtain a first starting node with the hierarchical value as the initial hierarchy;
acquiring all nodes of a mesh structure to which the first starting node belongs based on the first starting node until all nodes of all mesh structures are extracted to obtain one or more mutually independent mesh structures;
and (4) setting coordinates of the nodes in each reticular structure and then placing the nodes.
11. The node formatting apparatus of claim 10, wherein the first placer module is further configured to:
selecting a first mesh structure from the front-end mesh structures;
acquiring a second starting node corresponding to the first mesh structure, and traversing from the second starting node to acquire hierarchy values corresponding to all nodes in the first mesh structure;
selecting a layer with the maximum number of nodes in the hierarchy values as a reference and setting a first coordinate value of each node based on the hierarchy values corresponding to all nodes in the first mesh structure;
selecting a second mesh structure from the front-end mesh structure as a first mesh structure, and executing acquisition of a second initial node corresponding to the first mesh structure until the corresponding coordinate values of all nodes of each mesh structure in the front-end mesh structure are set;
and placing according to the corresponding coordinate values of the nodes.
12. The node formatting apparatus of claim 10, wherein the second pose module is further configured to:
determining a first node in all nodes, and setting a second coordinate value of the first node;
traversing from the first node to obtain second nodes, wherein the second nodes are all father nodes and all child nodes of the first node;
judging whether the path from the first node to the second node is unique or not;
if so, setting a third coordinate value of the second node based on the second coordinate value;
taking the second node as the first node, and continuing to execute the step of traversing from the first node to obtain the second node until the coordinate value setting of all the nodes is completed;
and converting the second coordinate value and the third coordinate value into real values and placing the real values on a page.
13. A node formatting device, the node formatting device comprising: memory, a processor and a node formatter stored on the memory and executable on the processor, the node formatter when executed by the processor implementing the steps of the node formatting method according to any one of claims 1 to 7.
14. A readable storage medium, having stored thereon a node formatting program which, when executed by a processor, implements the steps of the node formatting method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910961074.4A CN110690997A (en) | 2019-10-10 | 2019-10-10 | Node formatting method, device, equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910961074.4A CN110690997A (en) | 2019-10-10 | 2019-10-10 | Node formatting method, device, equipment and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110690997A true CN110690997A (en) | 2020-01-14 |
Family
ID=69111962
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910961074.4A Pending CN110690997A (en) | 2019-10-10 | 2019-10-10 | Node formatting method, device, equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110690997A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114048356A (en) * | 2022-01-12 | 2022-02-15 | 广东粤港澳大湾区硬科技创新研究院 | Knowledge input method, device and storage medium |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6279007B1 (en) * | 1998-11-30 | 2001-08-21 | Microsoft Corporation | Architecture for managing query friendly hierarchical values |
| US6377287B1 (en) * | 1999-04-19 | 2002-04-23 | Hewlett-Packard Company | Technique for visualizing large web-based hierarchical hyperbolic space with multi-paths |
| CN1571363A (en) * | 2004-05-13 | 2005-01-26 | 上海交通大学 | Network partitioning method for large-scale complicated network |
| CN101035023A (en) * | 2007-03-07 | 2007-09-12 | 华为技术有限公司 | Network structure topology layout method and network management device |
| CN101437273A (en) * | 2008-12-24 | 2009-05-20 | 北京科技大学 | Routing method for distributed cognition radio network based on layer-striding design |
| CN101465749A (en) * | 2008-12-29 | 2009-06-24 | 武汉大学 | Method for building interlocution service based on Web Service combination |
| US20110228788A1 (en) * | 2010-03-19 | 2011-09-22 | Cisco Technology, Inc. | Alternate down paths for directed acyclic graph (dag) routing |
| CN102663162A (en) * | 2012-03-16 | 2012-09-12 | 山西省电力公司太原供电分公司 | Method and device for constructing topology model of power grid |
| CN103124279A (en) * | 2011-11-18 | 2013-05-29 | 浪潮(北京)电子信息产业有限公司 | System for outputting resource information and method for achieving the same |
| US20140085307A1 (en) * | 2012-09-27 | 2014-03-27 | Oracle International Corporation | Automatic generation of hierarchy visualizations |
| CN104199824A (en) * | 2014-07-21 | 2014-12-10 | 武汉传神信息技术有限公司 | Method for judging node relation on tree-shaped data |
| CN104915410A (en) * | 2015-06-04 | 2015-09-16 | 福建天晴数码有限公司 | Storage and loading method of mind mapping and storage and loading system thereof |
| CN106708958A (en) * | 2016-11-30 | 2017-05-24 | 北京小米移动软件有限公司 | Typesetting structure display method and device for rendering engine |
| CN107783850A (en) * | 2017-09-28 | 2018-03-09 | 北京天元创新科技有限公司 | A kind of node tree chooses analytic method, device, server and the system of record |
-
2019
- 2019-10-10 CN CN201910961074.4A patent/CN110690997A/en active Pending
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6279007B1 (en) * | 1998-11-30 | 2001-08-21 | Microsoft Corporation | Architecture for managing query friendly hierarchical values |
| US6377287B1 (en) * | 1999-04-19 | 2002-04-23 | Hewlett-Packard Company | Technique for visualizing large web-based hierarchical hyperbolic space with multi-paths |
| CN1571363A (en) * | 2004-05-13 | 2005-01-26 | 上海交通大学 | Network partitioning method for large-scale complicated network |
| CN101035023A (en) * | 2007-03-07 | 2007-09-12 | 华为技术有限公司 | Network structure topology layout method and network management device |
| CN101437273A (en) * | 2008-12-24 | 2009-05-20 | 北京科技大学 | Routing method for distributed cognition radio network based on layer-striding design |
| CN101465749A (en) * | 2008-12-29 | 2009-06-24 | 武汉大学 | Method for building interlocution service based on Web Service combination |
| US20110228788A1 (en) * | 2010-03-19 | 2011-09-22 | Cisco Technology, Inc. | Alternate down paths for directed acyclic graph (dag) routing |
| CN103124279A (en) * | 2011-11-18 | 2013-05-29 | 浪潮(北京)电子信息产业有限公司 | System for outputting resource information and method for achieving the same |
| CN102663162A (en) * | 2012-03-16 | 2012-09-12 | 山西省电力公司太原供电分公司 | Method and device for constructing topology model of power grid |
| US20140085307A1 (en) * | 2012-09-27 | 2014-03-27 | Oracle International Corporation | Automatic generation of hierarchy visualizations |
| CN104199824A (en) * | 2014-07-21 | 2014-12-10 | 武汉传神信息技术有限公司 | Method for judging node relation on tree-shaped data |
| CN104915410A (en) * | 2015-06-04 | 2015-09-16 | 福建天晴数码有限公司 | Storage and loading method of mind mapping and storage and loading system thereof |
| CN106708958A (en) * | 2016-11-30 | 2017-05-24 | 北京小米移动软件有限公司 | Typesetting structure display method and device for rendering engine |
| CN107783850A (en) * | 2017-09-28 | 2018-03-09 | 北京天元创新科技有限公司 | A kind of node tree chooses analytic method, device, server and the system of record |
Non-Patent Citations (3)
| Title |
|---|
| JINGLEI LI; QINGHAI YANG; KYUNG SUP KWAK; LAJOS HANZO: "The Connectivity of Selfish Wireless Networks", IEEE ACCESS, 6 November 2015 (2015-11-06) * |
| 李蜀江: "基于CIM的配电网单线图自动绘图技术研究", 中国优秀硕士论文电子期刊网, 15 January 2019 (2019-01-15) * |
| 王威信;明春英;王宏安;戴国忠;: "基于Venn图的层次信息可视化", 计算机学报, no. 09, 15 September 2007 (2007-09-15) * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114048356A (en) * | 2022-01-12 | 2022-02-15 | 广东粤港澳大湾区硬科技创新研究院 | Knowledge input method, device and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111080170B (en) | Workflow modeling method and device, electronic equipment and storage medium | |
| US7685609B1 (en) | Using a distributed form object model to facilitate form event processing | |
| CN106648319B (en) | Operation method and device for mind map | |
| JP5790412B2 (en) | Stateless distributed parallel crawl technique for interactive client-server applications | |
| CN102891765B (en) | A kind of method realizing web network topology based on SNMP and HTML5 | |
| US9400962B2 (en) | Architecture for distributed, parallel crawling of interactive client-server applications | |
| CN105988933B (en) | The operable node recognition methods in interface, application testing method, apparatus and system | |
| US20120109931A1 (en) | Technique for compression of state information in the crawling of interactive client-server applications | |
| US20120109930A1 (en) | Technique for coordinating the distributed, parallel crawling of interactive client-server applications | |
| US11132477B1 (en) | Interactive simulation and solver for mechanical, fluid, and electro-mechanical systems | |
| US20220229638A1 (en) | Content development device | |
| CN110690997A (en) | Node formatting method, device, equipment and readable storage medium | |
| US8266153B2 (en) | Determining and displaying application server object relevance | |
| KR102225356B1 (en) | Method and apparatus of providing feedback on design of graphic user interface(gui) | |
| US20060200482A1 (en) | System, Method and Program Product for Setting and Managing Breakpoints in a Data Schema Mapping Editor | |
| JP5422589B2 (en) | Module analysis system, module analysis method, and module analysis program | |
| JP2019101889A (en) | Test execution device and program | |
| US20120109929A1 (en) | Technique for efficient partial crawling of interactive client-server applications in a parallel, distributed environment | |
| Schuler et al. | Rule-based generation of mobile user interfaces | |
| CN110389886A (en) | A kind of additional function test method, device and the storage medium of main body application program | |
| CN112328837A (en) | Data display method, device, equipment and storage medium | |
| CN111143186A (en) | Method and apparatus for application program interface API testing | |
| CN111143189A (en) | Method and apparatus for application program interface API testing | |
| US20230228647A1 (en) | Information processing apparatus and information processing method | |
| CN116991956B (en) | Signal interaction method based on EDA, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |