On Computing Top-$k$ Simple Shortest Paths from a Single Source

Mattia D'Emidio, Gabriele Di Stefano

We investigate the problem of computing the top-$k$ simple shortest paths in weighted digraphs. While the single-pair variant -- finding the top-$k$ simple shortest paths between t…