P174: Enumeration of all $(s, t)$-orientations of a biconnected planar graph

P174: Enumeration of all $(s, t)$-orientations of a biconnected planar graph

Input:

A biconnected planar graph $G = (V, E)$ and an edge $(s, t)$ in $G$.

Output:

All $(s, t)$-orientations of $G$.

Complexity:

$O(|V|)$ time per solution.

Comment:

Reference:

[Setiawan2011] (Bibtex)