# Revision history [back]

Indeed, it seems there is no method for enumerating spanning trees on digraphs (though there is a spanning_trees_count method for counting them based on the Kirchhoff matrix). If you have an implementation, let me suggest to add it into Sage itself, see http://www.sagemath.org/development.html