P441: Enumeration of all shortest paths between all pairs of vertices in a graph

P441: Enumeration of all shortest paths between all pairs of vertices in a graph

Input:

A graph $G$.

Output:

Enumeration of all shortest paths between all pairs of vertices $G$

Complexity:

Comment:

Reference:

[Hu1967] (Bibtex)