(idea) by artemis entreri Thu Dec 28 2000 at 15:01:45
A digraph D is an arborescence if there is a distinguished node x (called the root) and for every node y different from x there is exactly one elementary path from x to y.

--back to combinatorics--
I like it!