Shulou(Shulou.com)06/01 Report--

This article is about how to achieve the shortest path in GIS development. The editor thinks it is very practical, so share it with you as a reference and follow the editor to have a look.

GIS development, the shortest path is more commonly used, including many data platforms, two-dimensional maps, have achieved this function, there are several algorithms, the more commonly used is Dijstra algorithm, with the development of technology, this algorithm has been extended and optimized, in big data's situation, can also quickly find out the data results.

Dijstra algorithm was proposed by Dutch computer scientist Dick Stella in 1959, so it is also called Dixistra algorithm. It is the shortest path algorithm from one vertex to the other vertices, which solves the shortest path problem in the digraph.

In the case of the commonly used GIS software API, it is more convenient to use, if there is some data, how to realize the development of this algorithm, in the current mature technology, first of all, on github, we can find the Dijestra algorithm code written in various languages, and secondly, it should be combined with the actual data scenario for development.

Github search results are still quite a lot, of course, to enter English keywords (Dijkstra), so it is better to search, search results are more, the final realization is the same, in the application development scenario, to find ready-made faster, of course, the algorithm can write one, the Internet has detailed logic principles.

The amount of code is not very large, ready-made development is also fast, the following is mainly about how to organize the road network data, including Arcgis to do the shortest path analysis, mainly to do a good job of the data.

There is a shp road network data, from which to extract node, bi-directional, unidirectional, length, weight and other elements, of course, some elements are not necessary: the relationship between each node and other nodes; two nodes and a group of relationships, including length and weight; one-way node 1-> node 2, and two-way node 2-> node 1 The temporary route is truncated and the node direction needs to be removed temporarily.

Thank you for reading! This is the end of this article on "how to achieve the shortest path in GIS development". I hope the above content can be of some help to you, so that you can learn more knowledge. if you think the article is good, you can share it for more people to see!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.