noun ·Rare ·Advanced level

Definitions

Noun

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

Etymology

From poly- + tree.

Data sourced from Wiktionary, WordNet, CMU, and other open linguistic databases. Updated March 2026.