Noun
polytree (plural polytrees) (graph theory) a graph with at most one undirected path between any two vertices. In other words, a directed acyclic graph (DAG) for which there are no undirected cycles either.