Ask Your Question

David Auger's profile - activity

2017-04-15 15:06:59 -0500 received badge  Supporter (source)
2017-04-15 15:06:56 -0500 received badge  Scholar (source)
2017-04-14 14:05:19 -0500 received badge  Student (source)
2017-04-13 08:52:56 -0500 asked a question Is there a way to compute the list of rooted spanning trees or arborescences in a directed graph ?

Given a directed graph $D$ and a specified vertex $r$, I would like the list of all directed spanning trees, or arborescences, rooted in $r$. This can be computed by induction as is done for spanning trees in undirected graphs with the spanning_trees method of the class Graph, but it seems like this has not been implemented for directed graphs.