Generating water clusters and other directed graphs

In this paper we will describe an efficient method to generate directed graphs with bounded in- and out-degree. Though developed for the special case of water clusters, which can be modelled as directed graphs with indegree and outdegree at most 2 that have no two directed edges with the same endpoints, the algorithm is also applicable and implemented in the more general context.