Optimal Path Searching Method Based on Dijkstra Algorithm
Cheng Ru-zhen · Journal of Hebei Normal University · 2008
A kind of method about optimal path searching based on Dijkstra algorithm is presented according to the deficiency of traditional Dijkstra algorithm in the application.A model of restricted area is designed in order to avoid time and space waste on calculating the unwanted nodes.By the use of optimal memory structure,a searching strategy with heuristic information is realized in this restricted area.The experimental result proves that the number of nodes searched and the time spent on calculation have decreased obviously by heuristic searching strategy,so the searching process can focus on the target node quickly.