P10: Enumeration of all st-paths in a graph

P10: Enumeration of all st-paths in a graph

Input:

A graph $G=(V,E)$ and $s, v \in V$.

Output:

All st-paths in $G$.

Complexity:

$O(|E| + \sum_{\pi \in \mathcal{P}_{st}(G)}|\pi|)$ total time.

Comment:

$\mathcal{P}_{st}(G)$ is the set of all st-paths in $G$.

Reference:

[Ferreira2012] (Bibtex)