noun
Meaning 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.
Definition source: English Wiktionary via Wiktextract
Topics: graph-theory, mathematics, sciences
No example sentence was provided for this meaning.
Meaning relationships
Synonyms: none provided
Antonyms: none provided