polytree
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.
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.
Origin
Etymology tree Proto-Indo-European *pleh₁- Proto-Indo-European *polh₁ús Ancient Greek πολῠ́ς (polŭ́s)lbor. English poly- Proto-Indo-European *drew- Proto-Indo-European *-om Proto-Germanic *trewą Proto-West Germanic *treu Old English trēow Middle English tre English tree English polytree From poly- + tree.