directed trees versus singly-connected directed graphs

251 Views Asked by At

According to wikipedia, a singly connected directed graph (a.k.a. Polytree) is a Directed Acyclic Graph whose underling undirected graph is a tree. How is this different from directed trees (trees where we orient their edges arbitrary) ?