Let’s suppose I have a solution given by Dijkstra’s algorithm (the shortest path from one vertex to all of the other ones). Is there any result or algorithm available regarding how to update the distances if an edge is either added or removed?