P513: Enumerate all single source orientations of a graph

P513: Enumerate all single source orientations of a graph

Input:

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

Output:

All the orientations of $G$, such that $s$ is the only source.

Complexity:

$O(|E|)$ delay with $O(|E|)$ space.

Comment:

Reference:

[Conte2018] (Bibtex)