Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Geomatics World》 2016-06
Add to Favorite Get Latest Update

A Shortest Path Algorithm Based on Tree Decomposition of Min-fill

JI Lubing;WU Rongguang;CHEN Jiangling;Faculty of Geosciences & Environmental Engineering, Southwest Jiaotong University;  
With the rapid development of society, the scale of the road network is increasing rapidly and the classical algorithms can't satisfy with the real-time demand. According to the query algorithm based on tree decomposition of mindegree, this paper put forward the better one based on tree decomposition of min-fill in the weighted and directed graph, and optimized the process of solving the set in the searching algorithm. The results showed that with the increasing scale of data, the algorithm's time efficiency offered orders-of-magnitude performance improvement over the Dijkstra algorithm based on binary heap.
【Key Words】: tree decomposition min-fill min-degree shortest route
【Fund】: 国家自然科学基金项目(41471383)资助
【CateGory Index】: TP301.6
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