P80: Enumeration of $k$ shortest paths of a directed graph

P80: Enumeration of $k$ shortest paths of a directed graph

Input:

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

Output:

$k$ shortest paths that may contains cycles in $G$.

Complexity:

Comment:

Reference:

[Martins1984] (Bibtex)