Shortest Path Computation in a Network with Multiple Destinations.

The shortest path problem is the problem of finding a path with minimum total weight from a source node to each destination node in a network. The existing solution to this fundamental problem searches the shortest paths to all network nodes until it meets the given multiple-destination nodes. By granting preference to routes to each destination node, the proposed algorithm meets the destination nodes faster. The results of the experimental analysis on a real-world dataset and simulated random networks show the superiority of the proposed algorithm to the existing solution. This remarkable improvement makes the proposed algorithm applicable in all related applications. [ABSTRACT FROM AUTHOR]