A subtree hypergraph is a hypergraph on the vertices of the graph g,
each of whose hyper-edges induces a subtree in g. If v
is given, each
element of the list must contain at least two elements. For each element of
v, all paths between it's first element and each of the other elements
are computed, and the hyper-edge corresponds to all the vertices in these
paths.