I have heard the term rooted forest used in graph theory (I can't seem to find a good source to link, though). It seems like it is a collection of subgraphs of a directed acyclic graph, with each subgraph having a root.
Can someone draw a rooted forest for me?
$\endgroup$ 3 Reset to default