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.
Revision history [back]
 | 1 | initial version |
Is there a way to compute the list of rooted spanning trees or arborescences in a directed graph ?
| | 2 | retagged |
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.
