LAUSR

AbstractDynamic 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.