Classical shortest-circuit path algorithms is a basic of the transportation network analysis system, which has already got the extensive research in theoretic.
经典的最短路径算法是交通网络分析系统的一个基本算法，在理论上已经得到了广泛深入的研究。
In order to solve the intelligent transportation system in transportation network analysis and the shortest path problem, this paper proposes a weighted identification S-graph shortest path algorithm.
为解决智能交通系统中交通运输网络分析和最短路径问题，提出加权标识s -图最短路径算法。
应用推荐