A method and system for solving shortest paths from multiple sources to multiple destinations faster. A method of solving the multiple-pairs shortest path problem is provided using processing by a computer having storage means. The method includes the steps of: (A) reading graph data S on multiple vertices as search starting points from a storage area of the computer; (B) reading graph data T on multiple vertices as search targets from the storage area of the computer; (C) selecting k vertices s1, s2, . . . , sk from the graph data S; (D) deleting the k vertices from the graph data S; (E) finding and storing, in the storage area, shortest path lengths from each of the selected k vertices to the graph data T; and (F) repeating the steps from (C) to (E) until the graph data S becomes empty.