Hierarchical Cohesion-Based Shortest Path Search Method for Large-Scale Graphs

Abstract

The invention discloses a large-scale graph shortest path searching method based on hierarchical agglomerative clustering. The method comprises the following steps: S1, coarsening a network: agglomerating adjacent nodes to form a super node by using a breadth first algorithm according to an adjacency relation, performing coarsening processing on an initial large-scale network n0, obtaining a network N1 through once coarsening, obtaining multiple networks with gradually reduced node numbers through multiple coarsening, denoting as N1, N2, ...Nt; S2, searching a shortest path on the coarsened network: S21, enabling k=t; S22, searching the shortest path Pk to the super node to which the destination e belongs from the super node to which the source node s belongs on the coarsened network Nk; S23, finding the secondary super node covered by the shortest path Pk on a secondary coarsened network Nk-1, thereby forming a network Gk-1; S24, regarding the network Gk-1 obtianed in the step S23 asthe coarsened network in the step S22, namely, enabling Nk=Gk-1, and enabling k=t-1; and S26, cyclically executing the steps S22-S25 until t=1, obtaining the shortest path P0, namely the shortest pathobtained through the searching, and outputting P0.

Description

technical field [0001] The invention belongs to the technical field of network analysis and calculation, in particular to a method for searching the shortest path of a large-scale graph based on hierarchical cohesion. Background technique [0002] In reality, many systems can be abstracted into networks, such as the Internet, transportation network, logistics network, social network, and power grid. With the economic development of globalization, social changes and the advancement of information technology, the scale of various networks is rapidly expanding and the complexity of the network is increasing. The study of complex large-scale networks has become a hot spot and research frontier in the academic and engineering circles. [0003] The shortest path problem is a kind of problem in graph analysis or network analysis that is widely valued and studied. It is widely used in many fields such as computer science, transportation network, communication engineering, operation...

AI Technical Summary

Problems solved by technology

[0004] 1) Dijkstra's algorithm (Dijkstra's algorithm), its serial computational complexity is O(m+nlogn); Dijkstra's algorithm can obtain the optimal solution of the shortest path, but because it traverses many nodes for calculation, the efficiency Low;

[0005] 2) A* algorithm (A-Star), which is the most effective heuristic direct search method for solving the shortest path in a static road network, and is also a common heuristic algorithm for many other problems, but for large-scale complex networks, Its evaluation function is difficult to construct, and it is also difficult to calculate during the search process

Images