polytree

Meaning

1. noun 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.

Similar words

tree multitree directed acyclic graph forest caterpillar tree plane tree acyclic digraph dipath hypertree dicycle