P121: Enumeration of $k$ shortest paths in a graph

P121: Enumeration of $k$ shortest paths in a graph

Input:

A graph $G = (V, E)$.

Output:

$K$ shortest paths in $G$.

Complexity:

$O(|V|^3)$ total time.

Comment:

Reference:

[Yen1971] (Bibtex)