Study of Shortest Path Based on Weighted Identification S-graph
Liu A-ning · Jisuanji gongcheng · 2011
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.According to the basic principle and Petri nets weighted S-graph characteristics,it puts forward the weighted S-graph network model.A weighted identification shortest path S-graph basic principle is illustrated,a weighted S-map identifies the shortest path.Through the transportation network of sample and experiment verified,the algorithm is compared and analyzed.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.