Enumerates all spanning trees in a directed graph using the Gabow and Myers algorithm from the following paper:

Gabow, Harold N. and Myers, Eugene W. Finding all spanning trees of directed and undirected graphs. SIAM J. of Comput., Vol. 7, No. 3, August 78, pp. 280-287

Written in C++ and implemented as a Visual Studio 2010 solution