FLOYD Algorithm Based on the Shortest Path in GIS

  • Yv Mei Liao
  • Jie Zhong
Conference paper

DOI: 10.1007/978-3-642-29084-8_89

Volume 267 of the book series Communications in Computer and Information Science (CCIS)
Cite this paper as:
Liao Y.M., Zhong J. (2012) FLOYD Algorithm Based on the Shortest Path in GIS. In: Qu X., Yang Y. (eds) Information and Business Intelligence. Communications in Computer and Information Science, vol 267. Springer, Berlin, Heidelberg

Abstract

GIS shortest path calculation of the key issues, using the Floyd algorithm with traffic map any two points on the map to determine the existence of the path, calculate the route there is a path between any two points the distance. Gives a detailed GIS mapping and image display program, proved that the algorithm can quickly and easily retrieve the shortest path between two locations, saving computing time and overhead.

Keywords

Floyd algorithm shortest path GIS undirected graph 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Yv Mei Liao
    • 1
  • Jie Zhong
    • 2
  1. 1.College of Mechanical EngineeringXinyu UniversityXinyuChina
  2. 2.Xinyu Television StationXinyuChina