Optimal Path Algorithms Research Based on the GIS Linear Vector Graphics and Simulation Implementation
WU Ti-hua · Acta Simulata Systematica Sinica · 2003
The paper offers a 揅ut Branch Algorithm?for sampling the information of nodes that lie in the GIS linear vector graphics. Usually, it is more effectively for complex network system. On the basis of it, we get the optimal path sequence by applying the Dijkstra algorithm. At last, we develop a simulation software 揋ISLOOP?that uses VC++6.0 programming language and ESRI抯 MapObecjts2 Component as development tools. Depending on this software we analyze the GIS shapefile 搑oad_4m?downloaded from the National Foundation Geographic Information System (NFGIS) and make some approving results.