Dijkstras algorithm can be used to compute single source shortest paths from starting vertex s to any other vertexes. In practical applications, detours may be necessary due to unexpected obstacles in the shortest path. How to apply Dijkstras single source shortest path algorithm to the routing problem to avoid recomputing of the shortest path after each detour.