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.
Meaning & usage
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.
Where this word comes from
Etymology tree Proto-Indo-European *pleh₁-der. 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.
Try it on your idea.
polytree has 8 characters. Say it out loud, try it alongside a description of your project, and see whether its meaning fits what you want to create.
These are naming prompts. Meanings and pronunciation can vary; existing brand and domain uses have not been checked.
Explore the name generatorA word with a source.
Definitions, grammatical labels, IPA, etymology and examples: Wiktionary contributors, extracted by Kaikki / Wiktextract. Adapted under CC BY-SA 4.0. Selected fields and authored examples are shown; third-party quotations and audio are omitted. See contributor history.
Last enriched 2026-09-10. Definitions are in English. Romanizations are shown when supplied by the source; syllable estimates are omitted for unsupported scripts.