A New Way of Network Analysis Based on Dijkstra
Zhang Yu Fu · Remote Sensing Information · 2004
This paper introduces the classical arithmetic of Dijkstra, and it's limitation, which needs geometrical progression memory with increase of network nodes. The paper emphasizes an optimization of shortest path-the algorithm of adjoining nodess, and its improvement, which takes full advantage of the linking relation of arc section in network topology. This avoids conjunction matrix which includes lots of infinitude and suits huge data which includes turning. It is proved that the method can save lots of memory and suit not only huge network but also network of tuning restriction.