Abstract

When city emergencies happen, one of the most important tasks of emergency rescue is to find the shortest path to the emergency in shortest time, scientific and rational path plays an important role in improving rescue efficiency. According to the needs of city emergency rescue and basing on the analysis of the classical algorithm for solving the shortest path problem (Dijkstra algorithm), this article discusses an improved algorithm within dynamic restricted searching area which dynamically changes the direction of the search and restricts the searching area. This new method reduces time and space complexity and improves the efficiency of the algorithm. At the end of the article, it improves the practicality and reliability of this improved algorithm by simulation.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.