P56: Enumeration of the $k$ shortest paths in a graph

P56: Enumeration of the $k$ shortest paths in a graph

Input:

A graph $G = (V, E)$ and an integer $k$.

Output:

The $k$ smallest shortest paths in $G$.

Complexity:

$O(k|E|)$ total time.

Comment:

Reference:

[Azevedo1993] (Bibtex)