Research and implementation on an improved method of Dijkstra algorithm
Jun Yang · Cehui kexue · 2011
From the perspective of the path redundancy,focused on Intersection Path and Loop Path problems in Dijkstra algorithm,the paper proposed an improvement method of Dijkstra algorithm according to these problems.This method could optimize the path search space,decrease the original algorithm's time complexity and space complexity,and enhance the efficiency of the algorithm.And finally,the algorithm was validated through experiment. Key works:shortest path analysis;Intersection Path;Loop Path;Dijkstra algorithm