Listing All st-Orientations
Andry Setiawan, Shin-ichi Nakano · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2011
In this paper we give a simple algorithm to generate all st-orientations of a given biconnected plane graph G with a designated edge (s,t) on the outer face of G. Our algorithm generates all st-orientations of G in O(n) time for each without duplications, where n is the number of vertices.