Method and device for determining shortest route distance

The embodiment of the invention provides a method and device for determining the shortest route distance. The method comprises the steps that target graph pairs corresponding to first nodes and secondnodes are determined, wherein the graph pairs include first sub-graphs and second sub-graphs, the first nodes are nodes in the first sub-graphs, the second nodes are nodes in the second sub-graphs, and the diameter sum of two sub-graphs in each target graph pair is smaller than or equal to epsilon.s, wherein the epsilon represents an error value of a preset shortest route distance, and the s represents the separation distance between the first sub-graphs and the second sub-graphs; it is determined that the shortest route distance between the first nodes and the second nodes is the sum of theseparation distance between the first sub-graphs and the second sub-graphs, the diameter of the first sub-graphs and the diameter of the second sub-graphs. In the embodiment, the error between the determined shortest route dis