CN111930377A - Topological relation display method and device, server and storage medium - Google Patents
Topological relation display method and device, server and storage medium Download PDFInfo
- Publication number
- CN111930377A CN111930377A CN202010778881.5A CN202010778881A CN111930377A CN 111930377 A CN111930377 A CN 111930377A CN 202010778881 A CN202010778881 A CN 202010778881A CN 111930377 A CN111930377 A CN 111930377A
- Authority
- CN
- China
- Prior art keywords
- data
- node
- filtering
- topological relation
- graph
- 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.)
- Withdrawn
Links
- 238000000034 method Methods 0.000 title claims abstract description 44
- 230000003068 static effect Effects 0.000 claims abstract description 48
- 238000004806 packaging method and process Methods 0.000 claims abstract description 9
- 238000001914 filtration Methods 0.000 claims description 80
- 238000004590 computer program Methods 0.000 claims description 10
- 230000002159 abnormal effect Effects 0.000 claims description 8
- 238000011144 upstream manufacturing Methods 0.000 claims description 7
- 238000005538 encapsulation Methods 0.000 claims description 4
- 238000012986 modification Methods 0.000 claims description 3
- 230000004048 modification Effects 0.000 claims description 3
- 230000001747 exhibiting effect Effects 0.000 claims 1
- 238000011161 development Methods 0.000 abstract description 4
- 238000012423 maintenance Methods 0.000 description 8
- 238000012544 monitoring process Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 6
- 230000008569 process Effects 0.000 description 5
- 230000009471 action Effects 0.000 description 4
- 238000009877 rendering Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000001419 dependent effect Effects 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000008707 rearrangement Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012800 visualization Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/30—Creation or generation of source code
- G06F8/38—Creation or generation of source code for implementing user interfaces
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/60—Editing figures and text; Combining figures or text
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Human Computer Interaction (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a topological relation display method, a device, a server and a storage medium. The method comprises the following steps: packaging the topological relation data of the service node into static data; encapsulating the state data of the service node into dynamic data; and drawing a topological relation graph of the service node according to the static data and the dynamic data. When the requirements are changed, the method uses the original structures of the static data and the dynamic data, only the generation of the static data and the dynamic data needs to be adjusted, other modules do not need to be re-developed, code repetition is avoided, and the development efficiency is high.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a topological relation display method, a device, a server and a storage medium.
Background
In operation and maintenance monitoring systems, calling link systems and other systems, it is often necessary to visually display the dependency topology relationship between service nodes. The service dependence topological relation comprises service nodes and relation connecting lines among the service nodes, and the calling relation among the services can be visually and visually displayed. The common visualization scheme needs to comb node information to be displayed, define a data structure, develop data acquisition service, data assembly service, a front-end drawing module and a front-end entry function page according to display requirements, and is low in development efficiency.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method, an apparatus, a server, and a storage medium for displaying a topological relation, so as to implement unified management on an acquisition policy, change the acquisition policy more conveniently and quickly, and reduce application operation and maintenance costs.
In a first aspect, an embodiment of the present invention provides a method for displaying a topological relation, including:
packaging the topological relation data of the service node into static data;
encapsulating the state data of the service node into dynamic data;
and drawing a topological relation graph of the service node according to the static data and the dynamic data.
In a second aspect, an embodiment of the present invention further provides a device for displaying a topological relation, including:
the topological relation back-end computing module is used for packaging the topological relation data of the service nodes into static data;
the state data back end encapsulation module is used for encapsulating the state data of the service node into dynamic data;
and the front-end drawing module is used for drawing the topological relation graph of the service node according to the static data and the dynamic data.
In a third aspect, an embodiment of the present invention further provides a server, including a memory and a processor, where the memory stores a computer program that can be executed by the processor, and the processor executes the computer program to implement the topology relation displaying method as described above.
In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, where the storage medium stores a computer program, and the computer program, when executed by a processor, implements the topology relation displaying method as described above.
According to the technical scheme provided by the embodiment of the invention, the topological relation data of the service node is packaged into static data, the state data of the service node is packaged into dynamic data, the topological relation graph of the service node is drawn according to the static data and the dynamic data, and the topological relation graph is drawn through the universal static data and the universal dynamic data.
Drawings
FIG. 1 is a flowchart of a method for displaying a topological relation according to a first embodiment of the present invention;
FIG. 2 is a sub-flowchart of a topology relation displaying method according to a first embodiment of the present invention;
FIG. 3 is a sub-flowchart of a topology relation displaying method according to a first embodiment of the present invention;
FIG. 4 is a sub-flowchart of a topology relation displaying method according to a first embodiment of the present invention;
FIG. 5 is a flowchart of a topology relation displaying method in the second embodiment of the present invention;
fig. 6 is a schematic structural diagram of a topological relation displaying apparatus according to a third embodiment of the present invention;
fig. 7 is a schematic structural diagram of a server in the fourth embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention. It should be further noted that, for the convenience of description, only some of the structures related to the present invention are shown in the drawings, not all of the structures.
Before discussing exemplary embodiments in more detail, it should be noted that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although a flowchart may describe the steps as a sequential process, many of the steps can be performed in parallel, concurrently or simultaneously. In addition, the order of the steps may be rearranged. A process may be terminated when its operations are completed, but may have additional steps not included in the figure. A process may correspond to a method, a function, a procedure, a subroutine, a subprogram, etc.
Furthermore, the terms "first," "second," and the like may be used herein to describe various orientations, actions, steps, elements, or the like, but the orientations, actions, steps, or elements are not limited by these terms. These terms are only used to distinguish one direction, action, step or element from another direction, action, step or element. The terms "first", "second", etc. are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of the present invention, "plurality", "batch" means at least two, e.g., two, three, etc., unless specifically limited otherwise.
Example one
Fig. 1 is a flowchart of a method for displaying a topological relation according to an embodiment of the present invention, and this embodiment is applied to an operation and maintenance monitoring system or a terminal or a server calling a link system.
The example procedure is as follows:
s110, packaging the topological relation data of the service nodes into static data.
The service node is a node corresponding to a service for completing a request initiated by a client. The service node is the analysis basis of the operation and maintenance monitoring system and the call link system. The topological relation data can be directly obtained from the service nodes, and comprises identity information of the service nodes and association information among the service nodes. Because the topological relation data structures obtained from the service nodes may be different, the front-end drawing module designed for drawing the topological relation graph according to the topological relation data is designed for different service nodes, and code repetition is caused. In this embodiment, the server directly obtains the topology relation data of all the service nodes, and encapsulates the topology relation data into static data with a uniform format.
Illustratively, the encapsulated static data structure is as follows:
in the above example, the name of the node display, the name of the parent node, the detailed information of the node, the node type, and the node ID are used to describe the identity information of the service node, and the tag information, the current relationship hierarchy, the tag status, the information displayed on the label, the parent node ID, and the child node ID are used to describe the association information between the service nodes.
The data reporting method provided in this embodiment is based on a terminal or a server applied to an operation and maintenance monitoring system or a call link system, and the terminal or the server may obtain topology relationship data of all relevant service nodes. In specific application, a topological relation back-end computing module in the system is directly accessed to a topological relation data source, and static data are obtained by packaging topological relation data.
And S120, encapsulating the state data of the service node into dynamic data.
The state data is used to represent the current state of the service node, including the operational state of the service node and the associated states with other service nodes. The dynamic data is also used for representing the current state of the service node, and the data structures of the dynamic data and the service node are different.
Illustratively, the dynamic data may be divided into node status data and tag status data, where the node status data is:
the tag status data is: [{
"label": information displayed by the label ",
"labelStatus":0,
"labelInfo": air bubble display information when the mouse is suspended on the tag,
"parentID" for locating the tag location,
"child ID, for locating tag location",
level calling hierarchy "
}]
In the above example of the dynamic data structure, the node ID, the node status, and the abnormal node list are used to indicate the working status of the current service node, which is called as the node status, and correspond to the node status data; the information displayed by the label, the bubble display information when the mouse floats on the label, the father node ID, the child node ID and the calling level are used for representing the correlation state between the current service nodes, which is called label state and corresponds to label state data.
And corresponding to the step S110, a state data back-end encapsulation module is arranged in the operation and maintenance monitoring system or the call link system, and is connected with a state data source to encapsulate the state data to obtain dynamic data.
S130, drawing a topological relation graph of the service node according to the static data and the dynamic data.
The topological relation graph comprises graphs and texts, wherein the graphs are used for representing node connection relations and comprise nodes and edges for connecting the nodes, and the texts are used for representing node information and edge information.
When the topological relation graph is drawn, all nodes and edges which can appear are determined according to static data, and then the nodes and edges which are specifically displayed and the attached information of the nodes and the edges are determined by utilizing dynamic data, wherein the attached information comprises styles and characters.
Specifically, in one embodiment, as shown in FIG. 2, step S130 includes steps S131-132;
s131, drawing a first relation graph comprising nodes and edges according to the static data.
The first relation graph only represents the incidence relation between the service nodes, each service node corresponds to a node drawn on the first relation graph, and an edge is connected between two nodes on the first relation graph to represent that the two corresponding service nodes have the incidence relation.
More specifically, step S131, as shown in FIG. 3, includes steps S1311-1312:
s1311, determining static data, point information and side information, wherein the point information is used for determining positions of nodes, and the side information is used for determining incidence relations among the nodes.
S1312, drawing nodes according to the point information, drawing edges according to the edge information, and finishing drawing to obtain a first relational graph.
The operation and maintenance monitoring system or the calling link system is provided with a front-end entrance module for acquiring data and a front-end drawing module for drawing, the front-end entrance module draws static data at one time, and the front-end drawing module draws a first relation graph according to the static data.
S132, modifying the first relational graph according to the dynamic data to obtain the topological relational graph.
The topological relation graph reflects the current dependent topological relation of the service node, and is obtained by modifying the style and the characters of the node and the edge on the first relation graph according to the dynamic data on the basis of the first relation graph.
More specifically, as shown in FIG. 4, step S132 includes steps S1321-1322:
s1321, determining node state data and label state data in the dynamic data.
S1322, modifying the style and the characters of the corresponding node on the first relational graph according to the node state data, modifying the style and the characters of the corresponding edge on the first relational graph according to the label state data, and obtaining the topological relational graph after the modification is completed.
The operation and maintenance monitoring system or the front-end entry module in the calling link system regularly pulls the dynamic data, the timing mode can be set according to the actual requirement, for example, according to the preset time interval, and the front-end drawing module changes the node style and the characters and the style and the characters of the edges on the basis of the first relation graph according to the dynamic data.
According to the technical scheme, the topological relation data of the service nodes are packaged into static data, the state data of the service nodes are packaged into dynamic data, the topological relation graph of the service nodes is drawn according to the static data and the dynamic data, the topological relation graph is drawn through the universal static data and the universal dynamic data, when the requirements are changed, the original structures of the static data and the dynamic data are used, only the generation of the static data and the dynamic data needs to be adjusted, other modules do not need to be re-developed, code repetition is avoided, and development efficiency is high.
Example two
In this embodiment, on the basis of the first embodiment, a part of the content is further supplemented to provide more functions to meet the use requirements of the user, and specifically, a node filtering function is provided to facilitate the analysis of the complex dependency topology, specifically, as shown in fig. 5, after step S130, steps S210 to S230 are further included:
s210, acquiring a filtering request.
The filtering request is used to determine a filtering node, and includes filtering modes, in this embodiment, two filtering modes are provided, which are respectively filtering for the selected node and filtering for the abnormal node, and for the filtering for the selected node, the filtering request should further include selected information according to the user, and the selected information is generated according to the service node selected by the user.
Specifically, the terminal or the server may provide an interactive interface to obtain the user operation, and generate the filtering request according to the user operation, for example, a dialog box is used for the user to select the filtering mode.
S220, determining a filtering node according to the filtering request, and filtering an upstream path and a downstream path passing through the filtering node in the first relational graph to obtain a second relational graph.
Specifically, in an embodiment, determining a filtering node according to the filtering request includes steps S221 to 223 (not shown):
s221, determining a corresponding filtering mode to be selected node filtering or abnormal node filtering according to the filtering request.
S222, if the filtering mode is selected node filtering, determining selected information of the user according to the filtering request, and taking the node corresponding to the selected information as a filtering node.
When the user needs to select the node for filtering, the terminal or the server can select the server node needing to be filtered by the user in a mode of providing a filtering list, and select information is generated according to the service node selected by the user. In the static data structure example, an "info" object is included, which is used to obtain node IDs and corresponding detailed information, when filtering is performed according to a selected node, node IDs and detailed information of all service nodes can be provided in a filtering list, and a user can select a service node to be filtered through both methods.
And S223, if the filtering mode is abnormal node filtering, determining an error node according to the node state data in the dynamic data, and taking the error node as a filtering node.
The dynamic data structure includes an object of "error nodes" for determining an error node, which is a filter node.
After the filtering node is determined, the server or the terminal takes the filtering node as an initial node, searches a father node from the initial node to the upstream, recursively searches until the entry node is finished, and records a passing path node; searching child nodes from the starting node to the downstream, recursively searching until the leaf nodes are finished, and recording the passing path nodes; and determining the upstream and downstream paths passing through the filtering nodes according to all the path nodes, and filtering the upstream and downstream paths to obtain a second relation graph.
And S230, modifying the second relational graph according to the dynamic data to obtain a topological relational graph.
After the second relational graph is obtained, the server or the terminal modifies the style of the node and the style and the text of the text and the edge on the second relational graph by using the dynamic data, and draws a finally displayed topological relational graph.
The method for displaying the topological relation provided by the embodiment further adds a process of node filtering on the basis of the first embodiment, and realizes that: and filtering the specific service node according to different node filtering modes to obtain a filtered topological relation graph, so that the analysis of the complex dependent topology is facilitated.
EXAMPLE III
Fig. 6 is a topological relation displaying apparatus 300 according to a third embodiment of the present invention, which specifically includes the following modules:
and the topological relation back-end computing module 310 is configured to encapsulate the topological relation data of the service node into static data.
And the state data back-end encapsulation module 320 is used for encapsulating the state data of the service node into dynamic data.
And a front end drawing module 330, configured to draw a topological relation graph of the service node according to the static data and the dynamic data.
More specifically, in one embodiment, the front end rendering module 330 includes a first rendering unit and a second rendering unit:
and the first drawing unit is used for drawing a first relational graph comprising nodes and edges according to the static data.
And the second drawing unit is used for modifying the first relational graph according to the dynamic data to obtain the topological relational graph.
More specifically, in an embodiment, the first drawing unit is specifically configured to:
determining static data to determine point information and side information, wherein the point information is used for determining the positions of nodes, and the side information is used for determining the association relationship between the nodes;
and drawing nodes according to the point information, drawing edges according to the edge information, and finishing drawing to obtain a first relational graph.
More specifically, in an embodiment, the second drawing unit is specifically configured to:
determining node state data and label state data in the dynamic data;
and modifying the style and the characters of the corresponding nodes on the first relational graph according to the node state data, modifying the style and the characters of the corresponding edges on the first relational graph according to the label state data, and obtaining the topological relational graph after the modification is finished.
More specifically, in an embodiment, the method further includes:
and the filtering request acquisition module is used for acquiring the filtering request.
The front end drawing module is further configured to determine a filtering node according to the filtering request, filter an upstream path and a downstream path passing through the filtering node in the first relational graph, and obtain a second relational graph, and the front end drawing module is further configured to modify the second relational graph according to the dynamic data to obtain a topological relational graph.
More specifically, in one embodiment, the front end rendering module includes:
and the filtering mode determining unit is used for determining the corresponding filtering mode to be one of selected node filtering and abnormal node filtering according to the filtering request.
And the first filtering node determining unit is used for determining the selected information of the user according to the filtering request and taking the node corresponding to the selected information as the filtering node if the filtering mode is selected node filtering.
And the second filtering node determining unit is used for determining an error node according to the node state data in the dynamic data if the filtering mode is abnormal node filtering, and taking the error node as a filtering node.
The topological relation display device provided by the embodiment encapsulates the topological relation data of the service node into static data, encapsulates the state data of the service node into dynamic data, draws the topological relation graph of the service node according to the static data and the dynamic data, draws the topological relation graph through the universal static data and the universal dynamic data, and only needs to adjust the generation of the static data and the dynamic data by using the original structures of the static data and the dynamic data when the requirement is changed, and other modules do not need to be re-developed, so that the code repetition is avoided, and the development efficiency is high.
Example four
Fig. 7 is a schematic structural diagram of a server according to a fourth embodiment of the present invention, as shown in fig. 7, the server includes a processor 70, a memory 71, an input device 72, and an output device 73; the number of the processors 70 in the server may be one or more, and one processor 70 is taken as an example in the figure; the processor 70, the memory 71, the input device 72 and the output device 73 in the server may be connected by a bus or other means, and the bus connection is exemplified in fig. 7.
The memory 71 is a computer-readable storage medium, and can be used for storing software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the topology relation showing method in the embodiment of the present invention (for example, the topology relation back-end calculating module 310, the state data back-end packaging module 320, the front-end drawing module 330, and the like in the topology relation showing device). The processor 70 executes various functional applications and data processing of the terminal/server by running software programs, instructions and modules stored in the memory 71, so as to implement the above-mentioned topological relation showing method.
The memory 71 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to the use of the terminal, and the like. Further, the memory 71 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some examples, the memory 71 may further include memory located remotely from the processor 70, which may be connected to a terminal/server through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The input device 72 may be used to receive input numeric or character information and generate key signal inputs related to user settings and function control of the terminal/server. The output device 73 may include a display device such as a display screen.
The server can execute the topological relation display method provided by the first embodiment or the second embodiment of the invention, and has functional modules and beneficial effects corresponding to the execution method.
EXAMPLE five
An embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements a topological relation display method provided in any embodiment of the present invention, where the method may include:
packaging the topological relation data of the service node into static data;
encapsulating the state data of the service node into dynamic data;
and drawing a topological relation graph of the service node according to the static data and the dynamic data.
More specifically, in some embodiments, the program, when executed by the processor, may further implement:
acquiring a filtering request;
determining a filtering node according to the filtering request, and filtering an upstream path and a downstream path passing through the filtering node in the first relational graph to obtain a second relational graph;
and modifying the second relational graph according to the dynamic data to obtain a topological relational graph.
The computer-readable storage media of embodiments of the invention may take any combination of one or more computer-readable media. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a storage medium may be transmitted over any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + +, or the like, as well as conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or terminal. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
It is to be noted that the foregoing is only illustrative of the preferred embodiments of the present invention and the technical principles employed. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments illustrated herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, although the present invention has been described in greater detail by the above embodiments, the present invention is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit of the present invention, and the scope of the present invention is determined by the scope of the appended claims.
Claims (10)
1. A topological relation display method is characterized by comprising the following steps:
packaging the topological relation data of the service node into static data;
encapsulating the state data of the service node into dynamic data;
and drawing a topological relation graph of the service node according to the static data and the dynamic data.
2. The method for displaying topological relation according to claim 1, wherein said drawing the topological relation graph of the service node according to the static data and the dynamic data comprises:
drawing a first relation graph comprising nodes and edges according to the static data;
and modifying the first relational graph according to the dynamic data to obtain the topological relational graph.
3. The topological relation showing method of claim 2, wherein said drawing a first relation graph including nodes and edges according to said static data comprises:
determining static data to determine point information and side information, wherein the point information is used for determining the positions of nodes, and the side information is used for determining the association relationship between the nodes;
and drawing nodes according to the point information, drawing edges according to the edge information, and finishing drawing to obtain a first relational graph.
4. The method for displaying topological relation according to claim 3, wherein the modifying the first relation graph according to the dynamic data to obtain the topological relation graph comprises:
determining node state data and label state data in the dynamic data;
and modifying the style and the characters of the corresponding nodes on the first relational graph according to the node state data, modifying the style and the characters of the corresponding edges on the first relational graph according to the label state data, and obtaining the topological relational graph after the modification is finished.
5. The method for displaying topological relation according to claim 1, wherein after the drawing the topological relation graph of the service node according to the static data and the dynamic data, the method further comprises:
acquiring a filtering request;
determining a filtering node according to the filtering request, and filtering an upstream path and a downstream path passing through the filtering node in the first relational graph to obtain a second relational graph;
and modifying the second relational graph according to the dynamic data to obtain a topological relational graph.
6. The method of claim 5, wherein determining a filter node based on the filter request comprises:
determining a corresponding filtering mode to be one of selected node filtering and abnormal node filtering according to the filtering request;
if the filtering mode is filtering of the selected node, determining the selected information of the user according to the filtering request, and taking the node corresponding to the selected information as the filtering node;
and if the filtering mode is abnormal node filtering, determining an error node according to the node state data in the dynamic data, and taking the error node as a filtering node.
7. A topological relation exhibiting device, comprising:
the topological relation back-end computing module is used for packaging the topological relation data of the service nodes into static data;
the state data back end encapsulation module is used for encapsulating the state data of the service node into dynamic data;
and the front-end drawing module is used for drawing the topological relation graph of the service node according to the static data and the dynamic data.
8. The topological relation display device of claim 7, wherein said front end drawing module comprises:
the first drawing unit is used for drawing a first relation graph comprising nodes and edges according to the static data;
and the second drawing unit is used for modifying the first relational graph according to the dynamic data to obtain the topological relational graph.
9. A server, characterized by comprising a memory and a processor, wherein the memory stores a computer program which can be run by the processor, and the processor executes the computer program to realize the topological relation showing method according to any one of claims 1 to 6.
10. A computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, implements the topological relation exposure method of any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010778881.5A CN111930377A (en) | 2020-08-05 | 2020-08-05 | Topological relation display method and device, server and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010778881.5A CN111930377A (en) | 2020-08-05 | 2020-08-05 | Topological relation display method and device, server and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111930377A true CN111930377A (en) | 2020-11-13 |
Family
ID=73306473
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010778881.5A Withdrawn CN111930377A (en) | 2020-08-05 | 2020-08-05 | Topological relation display method and device, server and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111930377A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113014674A (en) * | 2021-04-08 | 2021-06-22 | 北京百度网讯科技有限公司 | Method and device for drawing service dependency graph |
-
2020
- 2020-08-05 CN CN202010778881.5A patent/CN111930377A/en not_active Withdrawn
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113014674A (en) * | 2021-04-08 | 2021-06-22 | 北京百度网讯科技有限公司 | Method and device for drawing service dependency graph |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108958736B (en) | Page generation method and device, electronic equipment and computer readable medium | |
| US10922493B1 (en) | Determining a relationship recommendation for a natural language request | |
| US9165087B2 (en) | Validity path node pattern for structure evaluation of time-dependent acyclic graphs | |
| US20080162207A1 (en) | Relation-based hierarchy evaluation of recursive nodes | |
| CN106657192B (en) | Method and equipment for presenting service calling information | |
| US11676345B1 (en) | Automated adaptive workflows in an extended reality environment | |
| US20080162777A1 (en) | Graph abstraction pattern for generic graph evaluation | |
| CN114327678A (en) | Real-time data processing system and method supporting multiple engines | |
| CN113238740B (en) | Code generation method, code generation device, storage medium and electronic device | |
| CN111488109A (en) | Method, device, terminal and storage medium for acquiring control information of user interface | |
| CN112989151B (en) | Data blood relationship display method and device, electronic equipment and storage medium | |
| CN114077430A (en) | Interface generation method and device, electronic equipment and storage medium | |
| CN116360735A (en) | Form generation method, device, equipment and medium | |
| CN116911240A (en) | Command configuration method, device, equipment and medium of electronic automation design software | |
| CN111008865A (en) | Coupon synchronous display method and device, server and storage medium | |
| CN113485909B (en) | Test method, test device, computing equipment and medium | |
| CN117472372B (en) | Responsive form construction method and system | |
| CN114253530A (en) | Data visualization method, device, equipment and storage medium | |
| CN111930377A (en) | Topological relation display method and device, server and storage medium | |
| CN112883088B (en) | Data processing method, device, equipment and storage medium | |
| CN115827058A (en) | Data processing method, device, equipment and storage medium | |
| CN116431200A (en) | Configuration method, device, equipment and storage medium for application data configuration information | |
| CN114297443B (en) | Processing method, device, equipment and storage medium of graph data query statement | |
| CN110175917A (en) | The device and method of parameterized graphicsization processing | |
| CN113468342B (en) | Knowledge graph-based data model construction method, device, equipment and 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 | ||
| WW01 | Invention patent application withdrawn after publication | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20201113 |