Implementation of an optimized algorithms in the shortest path analysis
Yang Loong Chang · Journal of Changchun Post and Telecommunication Institute · 2002
New research and discovery on scheme of getting the best path in network and of shortest path are given by studying and analyzing other about shortest path. A new algorithm of shortest path analysis optimized Dijkstra algorithms is given. This method makes the search direction of Dijkstra algorithm reach goal crunodes,reduce ransacking crunodes and improve searching speed.Optimizing measuresare proposed,shortening the temporary serch mark crunodes and reducing the node scope that is to reduce the number of permanent mark crunodes.