Abstract
Dynamic shortest path algorithms modify the existing shortest path tree or graph, taking into account changes in the underlying graph configuration. In the premise of this paper, the dynamic Dijkstra algorithm is specifically considered which is used for the solution of single source shortest path problem in dynamic graphs. Dynamic Single Source Shortest Path (DSSSP) problem is considered from a completely different perspective. For incorporating the dynamic changes into the solution, the retroactive data structure has been used. Dynamics of retroactive data structures provide a natural order for propagating the desired changes in the underlying graph configuration. DSSSP has been solved in efficient way with worst case complexity O(m log n) and also proved the correctness of our proposed algorithm.
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 callDisclaimer: 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.
