Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Chang'an University(Natural Science Edition)》 2005-06
Add to Favorite Get Latest Update

Optimination Dijkstra arithmetic for shortest path of urban traffic net

ZHANG Wei-jun~1,WANG Hua~2(1.School of Earth Sciences and Resources Management,Chang'an University,Xi'an 710054,China;2.Depertmeat of Economy and Management,Shaanxi College of Communications Technology,Xi'an 710021,China)  
This paper established the road net model and database of urban traffic based on the study of the urban traffic road character.The shortest path was queried by the improving Dijkstra arithmetic,the arithmetic used B-tree in the start and end point separately in the direction of start-end and end-start.The times are 0.20 s and 0.23 s when using Optimination Dijkstra arithmetic and the Dijkstra arithmetic.The simulation results indicate that the complex grade in time is minished to O(n) from the Dijkstra's O(n~2),the shortest path is agreed with the practice,the(arithmetic) is an effective method in selecting the shortest path.2 tabs,1 fig,7 refs.
【Fund】: 国家自然科学基金项目(60072044)
【CateGory Index】: U491.13
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved