A Simple Algorithm for the Directed Multiple Source Replacement Paths Problem

Kaito Harada, Taisuke Izumi

In the replacement paths (RP) problem, we are given a graph $G=(V,E)$ with $n=|V|$ and $m=|E|$, together with two vertices $s,t\in V$, and are asked to compute the shortes…