An orientation of an undirected graph is obtained by assigning a direction to each of its edges. It is called cyclic when a directed cycle appears, and acyclic otherwise. We study efficient algorithms for enumerating the orientations of an undirected graph. To get the full picture, we consider both the cases of acyclic and cyclic orientations, under some rules specifying which nodes are the sources (i.e. their incident edges are all directed outwards). Our enumeration algorithms use linear space and provide new bounds for the delay, which is the maximum elapsed time between the output of any two consecutively listed solutions. We obtain a delay of O(m) for acyclic orientations and ˜Oand˜ and˜O(m) for cyclic ones. When just a single source is specified, these delays become O(m · n) and O(m · h + h 3), respectively, where h is the girth of the graph without the given source. When multiple sources are specified, the delays are the same as in the single source case. .