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 -图最短路径算法。
Experimental results show that the weighted identification S-graph shortest path algorithm for solving the transport network is an effective method for the shortest path.
结果表明，加权标识s -图最短路径算法能够更有效地求解交通网络最短路径。
应用推荐