A novel shortest path query algorithm

The shortest path query is one of the hot issues in graph research. In view of the low query efficiency and poor scalability caused by the long time of the construction of index and the large scale of index in the existing methods, we propose an associated index strategy based on the single branch path vertices, which is to construct the associated index for the vertex of single branch path vertices and construct the 2-hop label index for the other vertices in order to reduce the size and construction time of index by reducing the number of redundant data storage and graph traversal. Then we propose the corresponding shortest path query algorithm based on the single branch path vertices associated index. And then, we introduce the concept of core vertex for the construction of the 2-hop label index, which can further reduce the number of graph traversal and improve the efficiency of index construction. And we apply it to the shortest path query algorithm for the large graphs. Finally, according to test on the 12 real datasets, we verify the high efficiency of the method proposed in this paper compared with the existing methods from the following aspects, such as the index construction time, the index size and the shortest path query time.