P514: Enumerate all the acyclic orientations of a graph

P514: Enumerate all the acyclic orientations of a graph

Input:

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

Output:

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

Complexity:

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

Comment:

Reference:

[Conte2018] (Bibtex)