P178: Enumeration of all shortest paths in a graph

P178: Enumeration of all shortest paths in a graph

Input:

A graph $G$.

Output:

All shortest paths in $G$.

Complexity:

Comment:

Reference:

[Florian1981] (Bibtex)