Abstract
In Geographic Information System (GIS), the shortest path searching is an important network analysis function, meanwhile it is a basic method of other network analysis. Aimed to find the shortest path between two given nodes, this paper puts forward an improved shortest path searching algorithm by means of the bidirectional searching strategy. In this algorithm, we defined an bidirectional semi-order net to store dynamic information of Optimal paths in search progress. This paper result out all the shortest paths of two given nodes base on the bidirectional shortest path semi-order net. Then, this algorithm was implemented and tested in C++.Net platform. The testing results show the efficiency of the shortest path algorithm, based on bidirectional semi-order net, is much higher than the traditional Dijkstra algorithm. Finally, the widely application of this algorithm is also discussed on the analysis of algorithm efficiency.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dijkstra, E.W.: A Note on Two Problems in Connection with Graphs. Numerishe Mathematick 1(1), 269–271 (1959)
Shen, L., Zhang, X., Ma, F.-C.: Best-routing Algorithm for Public Traffic System. Hydrographic Surveying and Charting 25(6), 41–43 (2005)
Li, F., Zhang, J.-Z.: The Improvement and Implementation of the Network Shortest Path Algorithm. Journal of Xiamen University (Natural Science) 44 (supplement), 236–238 (2005)
Lu, F., Lu, D., Cui, W.: Improved Dijkstra Algorithm Based on Quad Heap Priority Queue and Inverse Adjacent List. Journal of Image and Graphics 4A(12), 1044–1049 (1999)
Yang, C.-B., Wang, K.-Y., Ma, S.-Z.: Implementation of an Optimized Algorithms in the Shortest Path Analysis. Journal of Jilin University (Information Science Edition) 20(2), 70–74 (2002)
Li, J.: Optimization Studies Based on Shortest Path Algorithm of Dijkstra. Journal of Weinan Teachers College 24(5), 61–64 (2009)
Wang, H.-M., Hu, M.: Shortest-path Algorithm Based on Direct/Indirect Adjacent Edge Concept. Journal of Computer Applications 30(5), 1297–1299, 1303 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Liu, L., Zhao, Z., Zhang, C. (2012). Shortest Path Algorithm Based on Bidirectional Semi-order Net. In: Lee, G. (eds) Advances in Computational Environment Science. Advances in Intelligent and Soft Computing, vol 142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27957-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-27957-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27956-0
Online ISBN: 978-3-642-27957-7
eBook Packages: EngineeringEngineering (R0)