Point-to-point shortest path calculation system in peer-to-peer network

Abstract

The invention discloses a point-to-point shortest path calculation system in a peer-to-peer network. The calculation system obtains starting point information and ending point information of a shortest path between a given starting point S and a given ending point E in the peer-to-peer network through an information obtaining module; a path calculation module extracts n different nodes Mi that maybe passed between the given starting point S and the given ending point E in a network link according to the starting point information and the ending point information obtained by the information obtaining module, and respectively calculates a first shortest path from the given starting point S to the node Mi and a second shortest path from the node Mi to the given ending point E to obtain the shortest path between the given starting point S and the given ending point E. The point-to-point shortest path calculation system has the beneficial effect of simplifying the shortest path algorithm,avoiding the problem of over high computational complexity caused by the calculation mode of calculating the point-to-point shortest path by using a large number of complex algorithms, improving the computational efficiency, saving computing resources and shortening the computing time.

Description

technical field [0001] The invention relates to the technical field of the Internet, in particular to a point-to-point shortest path calculation system in a peer-to-peer network. Background technique [0002] The shortest path problem between two points is a classic algorithm problem, and it is also an important sub-problem in many practical applications; for example, in electronic navigation, urban planning, computer network and communication, intelligent transportation system, transportation tourism, geographic information system and engineering technology and so on have a wide range of applications. Specifically, for example, in a communication network, when a user communicates with another user, it is necessary to find the shortest communication path to minimize communication delay and consumption. However, in the prior art, most of the related schemes for calculating the shortest path between two points are relatively complicated and consume a large amount of computing...

AI Technical Summary

Problems solved by technology

However, in the prior art, most of the related schemes for calculating the shortest path between two points are relatively complicated and consume a large amount of computing resources

Images