Unlock instant, AI-driven research and patent intelligence for your innovation.
Shortest path searching method and system based on complex network theory
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A complex network, shortest path technology, applied in other database retrieval, other database query and other directions, can solve the problem of inability to obtain the shortest path accurately, wasting cache space, poor timeliness, etc.
Pending Publication Date: 2022-07-22
WUHAN UNIV OF TECH
View PDF0 Cites 0 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
[0003] Due to the huge number of nodes in the complex network and frequent network changes, the traditional shortest path algorithm will consume a lot of time and have poor timeliness. At the same time, it will waste a lot of cache space and cannot accurately obtain the accurate shortest path when the network changes. path
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0028] This embodiment provides a shortest path search method based on complex network theory, including:
[0029] S1: Use the processing module 100 to preprocess the complex network to simplify the complex network.
[0030] (1) Delete the leaf nodes whose degree is 1 in the complex network;
[0031] (2) Add n connecting edges, and judge whether the connecting edges connect two adjacent regions, if so, set the two nodes corresponding to the connecting edges as relay nodes, otherwise, delete these two nodes;
[0032] Preferably, this embodiment simplifies the complexity of the network by deleting a large number of nodes.
[0033] S2: The simplified complex network is divided into regions by the network division module 200, and the local center points of the regions are solved.
[0034] (1) Calculate the local center point set of the simplified complex network;
[0035] ①Calculate the degree and aggregation coefficient of each node in the simplified complex network;
[0036]...
Embodiment 2
[0056] refer to figure 1 , is the second embodiment of the present invention, which is different from the first embodiment in that it provides a shortest path searchsystem based on complex network theory, including:
[0057] The processing module 100 is used for preprocessing the complex network and simplifying the complex network;
[0058] The network division module 200, together with the processing module 100, is used for regional division of the simplified complex network, and for solving the local center point of the region;
[0059] The path solving module 300 is connected to the network dividing module 200, and is used for establishing a relay node table according to the local center point, calculating the distance from the local center point of the area to each relay node, and obtaining the shortest path in combination with the complexity.
[0060] It should be appreciated that embodiments of the present invention may be implemented or implemented by computer hardwar...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
PUM
Login to View More
Abstract
The invention discloses a shortest path searching method and system based on a complex network theory, and the method comprises the steps: carrying out the preprocessing of a complex network through a processing module, and simplifying the complex network; carrying out region division on the simplified complex network through a network division module, and solving a local center point of a region; the path solving module establishes a relay node table according to the local center point, calculates the distance from the local center point of the area to each relay node, and obtains the shortest path in combination with the distance complexity; the method can adapt to a complex network containing a large number of nodes, is high in anti-interference capability, and can accurately search the shortest path of the complex network.
Description
technical field [0001] The invention relates to the technical field of network node path search, in particular to a shortest path search method and system based on complex network theory. Background technique [0002] A complex network is a high degree of abstraction of the real network in the real world, abstracting various individuals in the real world as nodes in the network, and abstracting the relationship between various individuals as edges in the network, thereby obtaining a kind of pairing. Methods for analyzing networks that exist in the real world. Through the analysis and research of complex network, its inherent characteristics and interrelationships are revealed, people's cognitive level of the network in the real world is enhanced, and a higher ability to transform the network in the real world is obtained. [0003] Due to the huge number of nodes in the complex network and frequent network changes, the traditional shortest path algorithm will consume a lot o...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to View More 
Login to View More