Learn More
We describe a new algorithm to enumerate the k shortest simple (loopless) paths in a directed graph and report on its implementation. Our algorithm is based on a replacement paths algorithm proposed recently by Hershberger and Suri [7], and can yield a factor Θ(n) improvement for this problem. But there is a caveat: the fast replacement paths subroutine is(More)
  • 1