2 replaced http://cs.stackexchange.com/ with https://cs.stackexchange.com/ edited Apr 13 '17 at 12:48 For the $$k$$ shortest paths, there are algorithms; see for instance herehere. Enumerating all shortest paths is, however, an inherently costly thing; there may be superexponentially many such pathssuperexponentially many such paths. For the $$k$$ shortest paths, there are algorithms; see for instance here. Enumerating all shortest paths is, however, an inherently costly thing; there may be superexponentially many such paths. For the $$k$$ shortest paths, there are algorithms; see for instance here. Enumerating all shortest paths is, however, an inherently costly thing; there may be superexponentially many such paths. 1 answered Feb 5 '15 at 11:13 Raphael♦ 59k2525 gold badges144144 silver badges327327 bronze badges For the $$k$$ shortest paths, there are algorithms; see for instance here. Enumerating all shortest paths is, however, an inherently costly thing; there may be superexponentially many such paths.