P349: Enumeration of all quickest paths in a network
P349: Enumeration of all quickest paths in a network
Input:
A network $N = (V, E, c, \ell)$.
Output:
All quickest paths in $N$.
Complexity:
$O(rS|V||E| + rS|V|^2\log|V|)$ total time.
Comment:
$c$ is a positive edge weight function and $\ell$ is a nonnegative edge weight function. $r$ is the number of distinct capacity value of $N$. $S$ is the number of solutions.