 .A "polytree" (or "directed tree" or "oriented tree" or "singly connected network") is a directed acyclic graph (DAG) whose underlying undirected graph is a tree.In other words, if we replace its directed edges with undirected edges, we obtain an undirected graph that is both connected and acyclic.