Etude Et Extension D’Un Algorithme De Murghland

AbstractMurchland(5) published an algorithm for recomputing all shortest paths after a change in the length of only one arc in a network. We study that algorithm both from a theoretical and a computational point of view. We suggest a slight modification of the algorithm to improve computational efficiency. Murchland deals with the oriented case (dij≠dji da, where dij= length of arc from i to j). We also study the non-oriented case (dij=dji).