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

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

Input:

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

Output:

$K$ shortest paths in $G$.

Complexity:

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

Comment:

Reference:

[Shier1979] (Bibtex)