摘要
网络最短路问题有一些成熟的算法，但对于带有约束条件的网络最短路问题这些算法却显得无能为力。本文将网络最短路问题的Ｄｉｊｋｓｔｒａ算法进行了推广，得到了带约束ｅ的网络最短路算法，并将这一算法应用于解决实际问题。
There are some ripen algorithm for the problem to find the netwrok shortest route, but they are incapable when the problem is restrained by parameter-e. In this paper, we spread the Dijstra algorithm of the network shortest route, give an algorithm of the network shortest route which is restrainesd by parameter-e, then we use the algorithm to discuss a practical problem and the results are satisfactory.
