Multiple Source Replacement Path Problem

Manoj Gupta, Rahul Jain, Nitiksha Modi

One of the classical line of work in graph algorithms has been the Replacement Path Problem: given a graph $G$, $s$ and $t$, find shortest paths from $s$ to $t$ avoiding each edge…