Dijkstra proposes a new improved algorithm with high efficiency. Improved three aspects: the adjacent table as the storage structure of the road network topology using binary heap priority queue node distribution of the search process is divided into several stages, the introduction of dynamic limit the search to regional mechanisms. Finally, the actual road network testing and simulation results show the feasibility and advantages of the improved algorithm.

Dijkstra鏀硅繘绠楁硶鍦ㄨ溅杈嗗

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．