Dijkstra’s algorithm can be used to compute single sourceshortest paths from starting vertex s to any other vertexes. Inpractical applications, detours may be necessary due to unexpectedobstacles in the shortest path. How to apply Dijkstra’s singlesource shortest path algorithm to the routing problem to avoidrecomputing of the shortest path after each detour.