Generating regular directed graphs

In this article we describe an algorithm to efficiently generate all regular directed graphs for a given number of vertices and given degree. The directed graphs are constructed from regular bipartite (undirected) graphs.