P516: Enumerate all the cyclic orientations of a graph with a single source

P516: Enumerate all the cyclic orientations of a graph with a single source

Input:

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

Output:

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

Complexity:

$O(|E|\cdot h + h^3)$ delay with $O(|E|)$ space, where $h$ is the girth of $G$.

Comment:

Reference:

[Conte2018] (Bibtex)