Given a digraph A, and an N set of nodes in the digraph. I need to enumerate the set of out-trees that contain those nodes. Where all the the out-trees leaves terminate on a node in set N.
EDIT: I am now exploring options other than the one below. Also in my particular domain I don't need to enumerate a long list. I want a unique answer, but I do need to do an exhaustive search to make sure there is no second answer.
As a possible solution I am considering if finding the set T of all the maximum out-trees in the digraph A. Where the out-trees in T are not contained by any other out-tree in A. And I asked that other question here. The idea was to have on each node a list of out-trees of which the node is a member. And I would just intersect that for all nodes. Then search for out-trees, inside the maximum out-trees. To keep the number of trees down I would collapse bifurcations in particular way that I don't think is necessary to go into here.