An Algorithm for the Problem of Finding the Minimal-Cost Path with the Minimal Time
Jiao Jian-min · Computer Engineering and Science · 2008
As to the minimal-cost path problem with the minimal time in the transportation network which has both edge cost and edge time,an algorithm is put forward in this paper.The minimal cost path with the minimal time from the source node to all the object nodes can be derived quickly by using the algorithm.In the end,an example shows the effectiveness of the algorithm.