MLkP/CR algorithm-based undirected graph dividing method

Abstract

The invention discloses an MLkP / CR algorithm-based undirected graph dividing method, which relates to the technical field of the visualization of a network topological diagram and solves the problem that self-communication of graphs cannot be ensured in the conventional undirected graph dividing method. The method is divided into three stages which are a restriction stage, an initialization sub-stage and an optimization and refinement stage, wherein the restriction stage comprises the step of: performing restriction on an undirected graph G0 (V0, E0) to be divided to reduce the scale of a topological diagram to obtain the undirected graph Gn (Vn, En); the initialization sub-stage comprises the step of: performing k-division on the undirected graph Gn (Vn, En) to obtain k sub-graphs, wherein each sub-graph is self-communicated; and the optimization and refinement stage comprises the step of: performing optimization and refinement on the k sub-graphs and recovering the k sub-graphs into the original graph G0 (V0, E0) to obtain the divided undirected graph G0 (V0, E0). The method of the invention has the advantages of ensuring the self-communication of the interior of each sub-graph and the less association of the sub-graphs and making each part in the graph independent, and can be applied in various fields for the division of the topological diagrams, comprising the fields of parallel computation, VISL design, task planning, geographic information systems GIS and the like.

Description

technical field [0001] The invention relates to the technical field of visualization of network topology diagrams, in particular to the division of network topology diagrams. Background technique [0002] The network topology map plays a huge role in network management. Most of the network management takes the network topology map as the core of operation, that is, it displays the logical connection relationship and other information of network devices such as networks and routers in a graphical way. Directly perform management operations such as configuration, performance, fault, billing, and security in the network topology. [0003] The Internet topology is generally composed of tens of thousands of routers, that is, the number of points and edges in the corresponding network topology map is large, and the connection relationship is complex. It is extremely difficult to plan it directly at this scale, and the time-space complexity It will be very high, and the effect wil...

AI Technical Summary

Problems solved by technology

[0009] In order to solve the problem that the existing undirected graph segmentation method cannot guarantee the self-connectivity of the graph, the present invention proposes an undirected graph segmentation method based on MLkP / CR algorithm

Images