P304: Enumeration of all acyclic orientation of a graph

P304: Enumeration of all acyclic orientation of a graph

Input:

A graph $G = (V, E)$.

Output:

All acyclic orientation of $G$.

Complexity:

$O(N(|V|+|E|))$ total time ($O(|V|(|V|+E|))$ delay) and $O(|V| + |E|)$ space.

Comment:

A acyclic orientation of $G$ is an assignment of directions of each edge such that $G$ is acyclic.

Reference:

[Barbosa1999] (Bibtex)