关键词: 最少时间最小费用路 运输网络 算法

Abstract:

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 for ward 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 algorit hm. In the end, an example shows the effectiveness of the algorithm.

Key words: minimal cost path with minimal time, transportation network, algorithm