hello all,
it would be great if someone tell me an efficient algorithm to this question
If weight of an edge of a given graph is increased or decreased for which we already computed the shortest distances to each node from a given source node (using Dijkastra algorithm), give the updated shortest distances without re-computing it.