CN112968795A - Dynamic multilayer visualization method of complex cooperative network - Google Patents
Dynamic multilayer visualization method of complex cooperative network Download PDFInfo
- Publication number
- CN112968795A CN112968795A CN202110133422.6A CN202110133422A CN112968795A CN 112968795 A CN112968795 A CN 112968795A CN 202110133422 A CN202110133422 A CN 202110133422A CN 112968795 A CN112968795 A CN 112968795A
- Authority
- CN
- China
- Prior art keywords
- data
- user
- node
- network
- neighbors
- 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
- 238000007794 visualization technique Methods 0.000 title claims abstract description 10
- 238000000034 method Methods 0.000 claims abstract description 27
- 238000012545 processing Methods 0.000 claims abstract description 7
- 238000012800 visualization Methods 0.000 claims description 13
- 238000012937 correction Methods 0.000 claims description 3
- 238000003825 pressing Methods 0.000 claims description 3
- 238000012423 maintenance Methods 0.000 abstract description 5
- 238000010586 diagram Methods 0.000 abstract description 4
- 230000008859 change Effects 0.000 abstract description 3
- 230000007704 transition Effects 0.000 abstract description 3
- 230000009286 beneficial effect Effects 0.000 abstract 1
- 230000004888 barrier function Effects 0.000 description 3
- 238000013079 data visualisation Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000009877 rendering Methods 0.000 description 1
- 238000012216 screening Methods 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/04—Network management architectures or arrangements
- H04L41/044—Network management architectures or arrangements comprising hierarchical management structures
-
- 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/14—Network analysis or design
-
- 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]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Human Computer Interaction (AREA)
- Information Transfer Between Computers (AREA)
- User Interface Of Digital Computer (AREA)
Abstract
The invention relates to the technical field of networks, in particular to a dynamic multilayer visualization method of a complex collaboration network, which is characterized by comprising the following steps: the method comprises the following steps: s1: and (3) hierarchical system display: (1) acquiring system, network data and dependency relationship from a database; (2) and processing the data into JSON data, submitting the JSON data to a foreground (3) and drawing a structure diagram according to a data format. S2: hierarchical roaming: (1) acquiring JSON data; (2) then, coarse and fine data or fine data are screened according to a user; (3) and finally drawing the required creep force network data according to the user requirements. The invention has the beneficial effects that: the hierarchical architecture display is converted from a traditional server architecture diagram, so that operation and maintenance personnel of a data center can conveniently check the node roles in the system, dynamic time slices can be displayed according to the change data of the network in the system along with time, and a user can check the historical condition of the grid node transition in the system according to the function.
Description
Technical Field
The invention relates to the technical field of networks, in particular to a dynamic multilayer visualization method of a complex collaboration network.
Background
The complex network is a very general abstract and description mode for the complex system, emphasizes the topological characteristics of the system structure, and the topological properties of the complex network mainly include degree distribution, average path length, clustering coefficient and the like.
Chinese patent No. CN108446384A provides a network topology visualization system and a data visualization method based on WebGL. The system comprises: the large-scale network topology visualization display system comprises a large-scale network topology visualization display system, a data middle layer and a back-end server; the data middle layer is a middle connection part of the front-end browser and the back-end server and is used for processing data changes of the front end and the back end; the data intermediate layer is used for carrying out data processing, local caching and partial rendering on the data sent by the back-end server through a middleware, and transmitting and displaying part or all of the cached data according to a user display request of the front-end browser.
However, with a WebGL-based network topology visualization system and a WebGL-based data visualization method, the relationship between servers is difficult to find changes over time, and the problems of displaying the relationship between a service system and a service system, between a service system and a subsystem, and between a service system and a virtual machine, the problems that a proper representation method is lacked for the logical relationship between a service and a server, different types of server nodes cannot be intensively displayed and managed, and the adjacency relationship between server nodes can be quickly checked are not favorable for wide popularization and promotion.
Disclosure of Invention
The invention aims to provide a dynamic multilayer visualization method of a complex collaboration network, which solves the problems that the relationship between servers, which is proposed in the background art, is difficult to find changes along with long time, the relationship between a business system and a business system, the business system and a subsystem, and the business system and a virtual machine is difficult to show, the logical relationship between the business service and the servers lacks a proper representation method, different types of server nodes cannot be intensively shown and managed, and the adjacency relationship between the server nodes can be quickly checked.
The technical scheme of the invention is as follows: the dynamic multilayer visualization method of the complex collaboration network comprises the following steps:
s1: and (3) hierarchical system display:
(1) acquiring system, network data and dependency relationship from a database;
(2) processing the data into JSON data and submitting the JSON data to a foreground;
(3) and finally drawing a structure chart according to the data format.
S2: hierarchical roaming:
(1) acquiring JSON data;
(2) then, coarse and fine data or fine data are screened according to a user;
(3) and finally drawing the required creep force network data according to the user requirements.
S3: and (3) tiling and displaying: the method comprises the steps of grouping data layout and drawing grouping boundaries;
(1) acquiring JSON network data;
(2) calculating the number of systems presented;
(3) determining the central coordinates of each system according to the number of the systems;
(4) laying out corresponding network nodes in each system center coordinate;
(5) acquiring the node positions in turns and calculating a boundary convex hull of each system;
(6) the system boundary is generated using convex hull coordinates.
S4, checking network neighbors: including looking at packet neighbors and looking at node neighbors;
(1) firstly, clicking a node/system by a user;
(2) a user clicks the node, finds all first-degree neighbors, creates an edge representation and indicates all edges and neighbors;
(3) if the user clicks the system, traversing all nodes in the system, searching all first-degree neighbors of the nodes, creating an edge representation and indicating all edges and neighbors of all nodes in the system;
(4) the user clicks the node/system again to delete the display edge;
s5, editing the packet affiliation: entering an editing mode, dragging and editing, and storing an editing result;
(1) clicking to enter an editing mode by a user;
(2) pausing the layout of all nodes in the network;
(3) the user mobile node carries out attribution editing;
(4) updating JSON data according to the attribution of the correction node dragged by the user;
(5) clicking and saving by a user;
(6) interacting with the database and storing the editing data.
S6: and (3) displaying network details: the method comprises tree display, hierarchical architecture display and dynamic display;
(1) acquiring all internal nodes according to system data, and performing network display of details;
(2) drawing a system boundary to wait for the next operation of the user;
(3) if the user selects the layer tree display, branch expansion and folding are carried out according to the neighbor data and the user operation;
(4) if the user selects the hierarchical architecture display, drawing the hierarchical architecture according to the role data;
(5) and if the user selects dynamic display, drawing dynamic information according to historical network data of the system.
Further, the step of arranging the packet data in S3 sequentially includes: acquiring JSON network data, calculating the number of displayed systems, determining the central coordinate of each system according to the number of the systems, and laying out corresponding network nodes near the central coordinate of each system, wherein the step of drawing the grouping boundary in S3 sequentially comprises the following steps: acquiring JSON network data, traversing the coordinates of each node, calculating a convex hull, establishing an SVG Psth element and returning.
Further, the step of looking at the grouped neighbors in S4 sequentially includes: the user clicks on the system, traverses all nodes within the system, finds all first-degree neighbors, creates an edge representation and indicates all edges and neighbors of all nodes and the user clicks on the node/system again to delete the exposed edge.
Further, the step of looking at the node neighbors in S4 sequentially includes: the user clicks on the node, finds all its first degree neighbors, creates an edge representation and indicates all edges and neighbors and the user clicks on the node again to delete the exposed edges.
Further, the step of entering the editing mode in S5 sequentially includes: the user clicks into an edit mode, pauses the layout of all nodes in the network and waits for the user to drag or click a save button.
Further, the step of drag editing in S5 sequentially includes: the user can select one point by long-pressing the mouse and can carry out the moving-out operation: moving to the blank area from the inside of the system and deleting the node from the system, and moving in work can be carried out: moving from the outside area to the inside of the system and marking the node's home as the system, can perform the moving operation: move from one system to another, mark edited nodes and systems for later storage, and select save or repeat operations.
Further, the step of saving the editing result in S5 sequentially includes: and respectively analyzing the edited node and system information, transmitting the analyzed data into a background storage module, calling a storage function and returning according to the storage structure.
Further, the tree presentation in S6 sequentially includes: and judging whether the expansion is in an expanded state or a folded state according to the node clicked by the user, if the expansion is in the folded state, searching all neighbors (not including the system internal node) according to the click and adding the neighbors to the interface, and if the expansion is in the expanded state, deleting the neighbors (not including the system internal node) on the interface according to the clicked node.
Further, the step of hierarchical architecture presentation in S6 sequentially includes: the method comprises the steps of obtaining all roles in a system, distributing corresponding nodes according to the roles, recording areas of the nodes as an obstacle list, calculating a shortest path point according to the positions of the nodes and the path points, obtaining a starting point and an end point of a target path according to the sequence of an edge table, calculating an optimal broken line path according to the obstacle list and the path points, drawing an interface of the path, and adding the interface to the obstacle list.
Further, the step of dynamically presenting in S6 sequentially includes: obtaining historical network data from a background according to a system, converting the historical network data into a JSON data format, drawing grids in different time slices according to time slice data of a historical network, operating the time slices left and right by a user and checking network graphs at different times.
Compared with the prior art, the invention has the following improvements and advantages by improving the dynamic multilayer visualization method for providing the complex collaboration network:
(1) through the set network detail display case, the hierarchical architecture display is converted from the traditional server architecture diagram, the operation and maintenance personnel of the data center can conveniently check the node roles in the system, the dynamic display can carry out the display of dynamic time slices according to the change data of the network in the system along with the time, and a user can check the historical condition of the grid node transition in the system according to the function and know the change of the system.
(2) The method has the advantages that the problem of displaying the relation between the service system and the service system, between the service system and the subsystem and between the service system and the virtual machine can be solved by setting the hierarchical system display case which uses the system initialization interface, and the hierarchical network system can be checked through the case.
(3) Through the set case analysis for checking the network neighbors, the function is a one-time neighbor checking function for operation and maintenance personnel of the data center, a reference editing basis is provided for editing grouping attribution, and node attribution can be carried out by using reference network connection information.
Drawings
The invention is further explained below with reference to the figures and examples:
fig. 1 is a schematic view of the frame structure of the present invention.
Detailed Description
The present invention will be described in detail with reference to fig. 1, and the technical solutions in the embodiments of the present invention will be clearly and completely described, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items.
The invention provides a dynamic multi-layer visualization method of a complex collaboration network by improving, as shown in fig. 1, the following steps:
s1: and (3) hierarchical system display:
(1) acquiring system, network data and dependency relationship from a database;
(2) processing the data into JSON data and submitting the JSON data to a foreground;
(3) and finally drawing a structure chart according to the data format.
S2: hierarchical roaming:
(1) acquiring JSON data;
(2) then, coarse and fine data or fine data are screened according to a user;
(3) and finally drawing the required creep force network data according to the user requirements.
S3: and (3) tiling and displaying: the method comprises the steps of grouping data layout and drawing grouping boundaries;
(1) acquiring JSON network data;
(2) calculating the number of systems presented;
(3) determining the central coordinates of each system according to the number of the systems;
(4) laying out corresponding network nodes in each system center coordinate;
(5) acquiring the node positions in turns and calculating a boundary convex hull of each system;
(6) the system boundary is generated using convex hull coordinates.
S4, checking network neighbors: including looking at packet neighbors and looking at node neighbors;
(1) firstly, clicking a node/system by a user;
(2) a user clicks the node, finds all first-degree neighbors, creates an edge representation and indicates all edges and neighbors;
(3) if the user clicks the system, traversing all nodes in the system, searching all first-degree neighbors of the nodes, creating an edge representation and indicating all edges and neighbors of all nodes in the system;
(4) the user clicks the node/system again to delete the display edge;
s5, editing the packet affiliation: entering an editing mode, dragging and editing, and storing an editing result;
(1) clicking to enter an editing mode by a user;
(2) pausing the layout of all nodes in the network;
(3) the user mobile node carries out attribution editing;
(4) updating JSON data according to the attribution of the correction node dragged by the user;
(5) clicking and saving by a user;
(6) interacting with the database and storing the editing data.
S6: and (3) displaying network details: the method comprises tree display, hierarchical architecture display and dynamic display;
(1) acquiring all internal nodes according to system data, and performing network display of details;
(2) drawing a system boundary to wait for the next operation of the user;
(3) if the user selects the layer tree display, branch expansion and folding are carried out according to the neighbor data and the user operation;
(4) if the user selects the hierarchical architecture display, drawing the hierarchical architecture according to the role data;
(5) and if the user selects dynamic display, drawing dynamic information according to historical network data of the system.
Further, the step of arranging the packet data in S3 sequentially includes: acquiring JSON network data, calculating the number of displayed systems, determining the central coordinate of each system according to the number of the systems, and laying out corresponding network nodes near the central coordinate of each system, wherein the step of drawing the grouping boundary in S3 sequentially comprises the following steps: acquiring JSON network data, traversing the coordinates of each node, calculating a convex hull, establishing an SVG Psth element and returning.
Further, the step of looking at the grouping neighbors in S4 sequentially includes: the user clicks the system, traverses all nodes in the system, finds all first-degree neighbors, creates an edge representation and indicates all edges and neighbors of all nodes and the user clicks the node/system again to delete a display edge, and the function is a first-degree neighbor viewing function of operation and maintenance personnel of the data center.
Further, the step of looking at the node neighbors in S4 sequentially includes: the user clicks the node, finds all its first-degree neighbors, creates an edge representation and indicates all edges and neighbors and the user clicks the node again to delete the presentation edge, all its first-degree neighbors can be found by clicking the node.
Further, the step of entering the editing mode in S5 sequentially includes: the user clicks into an edit mode, pauses the layout of all nodes in the network and waits for the user to drag or click a save button.
Further, the step of drag editing in S5 sequentially includes: the user can select one point by long-pressing the mouse and can carry out the moving-out operation: moving to the blank area from the inside of the system and deleting the node from the system, and moving in work can be carried out: moving from the outside area to the inside of the system and marking the node's home as the system, can perform the moving operation: the method is moved from one system to another system, marks edited nodes and systems and is used for later storage, and selects to store or repeat the operations, so that the method is simple and convenient to operate and convenient to use.
Further, the step of saving the editing result in S5 sequentially includes: and the edited node and system information are respectively analyzed, the analyzed data are transmitted into a background storage module, a storage function is called, and the data are returned according to the storage structure, so that the storage function is realized.
Further, the tree presentation step in S6 sequentially includes: judging whether the expansion is in an expansion state or a folding state according to a node clicked by a user, searching all neighbors (not including system internal nodes) according to clicking and adding the neighbors to the interface if the expansion is in the folding state, deleting the neighbors on the interface according to the clicked nodes (not including the system internal nodes) if the expansion is in the expansion state, and performing one-degree, two-degree, three-degree and other neighbor expansion by taking a certain node as a center through tree display.
Further, the step of hierarchical architecture presentation in S6 sequentially includes: the method comprises the steps of obtaining all roles in the system, distributing corresponding nodes according to the roles, recording areas of the nodes as a barrier list, calculating a shortest path point according to the positions of the nodes and the path points, obtaining a starting point and an end point of a target path according to the sequence of an edge table, calculating an optimal broken line path according to the barrier list and the path points, drawing an interface of the path, and adding the interface to the barrier list, wherein the hierarchical architecture display is converted from a traditional server architecture diagram, and is convenient for operation and maintenance personnel of a data center to check the roles of the nodes in the system.
Further, the step of dynamically presenting in S6 sequentially includes: obtaining historical network data from a background according to a system, converting the historical network data into a JSON data format, drawing grids in different time slices according to time slice data of a historical network, operating the time slices left and right by a user, checking network graphs at different times, and dynamically displaying the historical condition of grid node transition in the system.
The working principle of the invention is as follows: the dynamic multilayer visualization method of the complex collaboration network comprises the following steps: acquiring system, network data and subordination from a database, processing the data into JSON data, submitting the JSON data to a foreground, drawing a structure chart according to a data format to acquire JSON data, screening coarse-grained data or fine-grained data according to a user, drawing required creep strength network data according to the user requirement, acquiring JSON network data, calculating the number of displayed systems, determining the central coordinate of each system according to the number of the systems, laying out corresponding network nodes in the central coordinate of each system, acquiring the node positions in turn and calculating the boundary convex hull of each system, generating a system boundary by using the convex hull coordinates, clicking the nodes/systems by the user, clicking the nodes by the user, searching all first-degree neighbors and creating edge representation to indicate all edges and neighbors, and traversing all nodes in the system if the user clicks the system, searching all first-degree neighbors and creating edge representations, indicating all edges and neighbors of all nodes in a system, clicking the nodes/deleting display edges of the system again by a user, clicking the nodes/deleting display edges of the system by the user, pausing layout of all nodes in the network, editing attributions by moving the nodes by the user, modifying node attributions according to dragging of the user, updating JSON data, clicking and storing by the user, obtaining all internal nodes according to system data to perform network display of details, drawing system boundaries to wait for next operation of the user, if the user selects layer tree display, performing branch expansion and folding according to neighbor data and user operation, if the user selects layer structure display, drawing a layer structure according to role data, and if the user selects dynamic display, drawing dynamic information according to network data in system history.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. The dynamic multilayer visualization method of the complex collaboration network is characterized in that: the method comprises the following steps:
s1: and (3) hierarchical system display:
(1) acquiring system, network data and dependency relationship from a database;
(2) processing the data into JSON data and submitting the JSON data to a foreground;
(3) and finally drawing a structure chart according to the data format.
S2: hierarchical roaming:
(1) acquiring JSON data;
(2) then, coarse and fine data or fine data are screened according to a user;
(3) and finally drawing the required creep force network data according to the user requirements.
S3: and (3) tiling and displaying: the method comprises the steps of grouping data layout and drawing grouping boundaries;
(1) acquiring JSON network data;
(2) calculating the number of systems presented;
(3) determining the central coordinates of each system according to the number of the systems;
(4) laying out corresponding network nodes in each system center coordinate;
(5) acquiring the node positions in turns and calculating a boundary convex hull of each system;
(6) the system boundary is generated using convex hull coordinates.
S4, checking network neighbors: including looking at packet neighbors and looking at node neighbors;
(1) firstly, clicking a node/system by a user;
(2) a user clicks the node, finds all first-degree neighbors, creates an edge representation and indicates all edges and neighbors;
(3) if the user clicks the system, traversing all nodes in the system, searching all first-degree neighbors of the nodes, creating an edge representation and indicating all edges and neighbors of all nodes in the system;
(4) the user clicks the node/system again to delete the display edge;
s5, editing the packet affiliation: entering an editing mode, dragging and editing, and storing an editing result;
(1) clicking to enter an editing mode by a user;
(2) pausing the layout of all nodes in the network;
(3) the user mobile node carries out attribution editing;
(4) updating JSON data according to the attribution of the correction node dragged by the user;
(5) clicking and saving by a user;
(6) interacting with the database and storing the editing data.
S6: and (3) displaying network details: the method comprises tree display, hierarchical architecture display and dynamic display;
(1) acquiring all internal nodes according to system data, and performing network display of details;
(2) drawing a system boundary to wait for the next operation of the user;
(3) if the user selects the layer tree display, branch expansion and folding are carried out according to the neighbor data and the user operation;
(4) if the user selects the hierarchical architecture display, drawing the hierarchical architecture according to the role data;
(5) and if the user selects dynamic display, drawing dynamic information according to historical network data of the system.
2. The method for dynamic multi-layer visualization of complex collaborative networks according to claim 1, characterized by: the step of grouping data placement in S3 sequentially includes: acquiring JSON network data, calculating the number of displayed systems, determining the central coordinate of each system according to the number of the systems, and laying out corresponding network nodes near the central coordinate of each system, wherein the step of drawing the grouping boundary in S3 sequentially comprises the following steps: acquiring JSON network data, traversing the coordinates of each node, calculating a convex hull, establishing an SVG Psth element and returning.
3. The method for dynamic multi-layer visualization of complex collaborative networks according to claim 1, characterized by: the step of looking at the grouping neighbors in S4 sequentially comprises: the user clicks on the system, traverses all nodes within the system, finds all first-degree neighbors, creates an edge representation and indicates all edges and neighbors of all nodes and the user clicks on the node/system again to delete the exposed edge.
4. The method for dynamic multi-layer visualization of complex collaborative networks according to claim 1, characterized by: the step of looking at the node neighbors in S4 sequentially includes: the user clicks on the node, finds all its first degree neighbors, creates an edge representation and indicates all edges and neighbors and the user clicks on the node again to delete the exposed edges.
5. The method for dynamic multi-layer visualization of complex collaborative networks according to claim 1, characterized by: the step of entering the editing mode in S5 sequentially includes: the user clicks into an edit mode, pauses the layout of all nodes in the network and waits for the user to drag or click a save button.
6. The method for dynamic multi-layer visualization of complex collaborative networks according to claim 1, characterized by: the step of drag editing in S5 sequentially includes: the user can select one point by long-pressing the mouse and can carry out the moving-out operation: moving to the blank area from the inside of the system and deleting the node from the system, and moving in work can be carried out: moving from the outside area to the inside of the system and marking the node's home as the system, can perform the moving operation: move from one system to another, mark edited nodes and systems for later storage, and select save or repeat operations.
7. The method for dynamic multi-layer visualization of complex collaborative networks according to claim 1, characterized by: the step of saving the editing result in S5 sequentially includes: and respectively analyzing the edited node and system information, transmitting the analyzed data into a background storage module, calling a storage function and returning according to the storage structure.
8. The method for dynamic multi-layer visualization of complex collaborative networks according to claim 1, characterized by: the tree presentation in S6 sequentially includes: and judging whether the expansion is in an expanded state or a folded state according to the node clicked by the user, if the expansion is in the folded state, searching all neighbors (not including the system internal node) according to the click and adding the neighbors to the interface, and if the expansion is in the expanded state, deleting the neighbors (not including the system internal node) on the interface according to the clicked node.
9. The method for dynamic multi-layer visualization of complex collaborative networks according to claim 1, characterized by: the step of hierarchical architecture display in S6 sequentially includes: the method comprises the steps of obtaining all roles in a system, distributing corresponding nodes according to the roles, recording areas of the nodes as an obstacle list, calculating a shortest path point according to the positions of the nodes and the path points, obtaining a starting point and an end point of a target path according to the sequence of an edge table, calculating an optimal broken line path according to the obstacle list and the path points, drawing an interface of the path, and adding the interface to the obstacle list.
10. The method for dynamic multi-layer visualization of complex collaborative networks according to claim 1, characterized by: the step of dynamically presenting in S6 sequentially includes: obtaining historical network data from a background according to a system, converting the historical network data into a JSON data format, drawing grids in different time slices according to time slice data of a historical network, operating the time slices left and right by a user and checking network graphs at different times.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110133422.6A CN112968795A (en) | 2021-02-01 | 2021-02-01 | Dynamic multilayer visualization method of complex cooperative network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110133422.6A CN112968795A (en) | 2021-02-01 | 2021-02-01 | Dynamic multilayer visualization method of complex cooperative network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112968795A true CN112968795A (en) | 2021-06-15 |
Family
ID=76272230
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110133422.6A Withdrawn CN112968795A (en) | 2021-02-01 | 2021-02-01 | Dynamic multilayer visualization method of complex cooperative network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112968795A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117376171A (en) * | 2023-12-07 | 2024-01-09 | 中国人民解放军国防科技大学 | Network situation data display method and system for large-scale network |
-
2021
- 2021-02-01 CN CN202110133422.6A patent/CN112968795A/en not_active Withdrawn
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117376171A (en) * | 2023-12-07 | 2024-01-09 | 中国人民解放军国防科技大学 | Network situation data display method and system for large-scale network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11853361B1 (en) | Performance monitoring using correlation search with triggering conditions | |
| US10838605B2 (en) | Reactive graphical display of real-time values | |
| US10853383B2 (en) | Interactive parallel coordinates visualizations | |
| US10887191B2 (en) | Service monitoring interface with aspect and summary components | |
| US11238033B1 (en) | Interactive location queries for raw machine data | |
| US10503745B2 (en) | Creating an entity definition from a search result set | |
| US10503746B2 (en) | Incident review interface | |
| CN107169247B (en) | Household industry service system based on 3D cloud design | |
| CN102891765B (en) | A kind of method realizing web network topology based on SNMP and HTML5 | |
| CN110929201B (en) | Complex network topology editing and visualization system based on Web | |
| CN111339316A (en) | Method and system architecture for realizing visual editing and persistence of knowledge graph | |
| US8669982B2 (en) | Method and system for generating and displaying an interactive dynamic culling graph view of multiply connected objects | |
| US9276820B2 (en) | Obtaining and displaying network topology information | |
| CN103413002A (en) | Topological graph editing method and topological graph editor | |
| CN106649805B (en) | Efficient detection system and method for cross-browser layout compatibility of Web application | |
| US10861202B1 (en) | Sankey graph visualization for machine data search and analysis system | |
| CN109388791A (en) | Chart Dynamic Display method, apparatus, computer equipment and storage medium | |
| US20160104090A1 (en) | State determination using per-entity thresholds | |
| CN107679276A (en) | Generation method, device and the electronic equipment of electric power system tide wiring diagram | |
| CN110322326A (en) | A kind of economic big data sharing method of geography based on ArgGis | |
| CN110413161A (en) | Arrrangement method, device and electronic equipment | |
| CN112968795A (en) | Dynamic multilayer visualization method of complex cooperative network | |
| CN111125592B (en) | Thermodynamic diagram rendering method and device for application program | |
| CN102868601B (en) | Routing system related to network topology based on graphic configuration database businesses | |
| CN114742981A (en) | Post-processing special effect manufacturing system and method, AR special effect rendering method and device |
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: 20210615 |