Definitions

from Wiktionary, Creative Commons Attribution/Share-Alike License

  • n. 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.

Etymologies

poly- +‎ tree (Wiktionary)

Examples

Sorry, no example sentences found.

Comments

Log in or sign up to get involved in the conversation. It's quick and easy.