polytree

Noun. (graph theory) 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.

This is an unmodified, but possibly outdated, definition from Wiktionary and used here under the Creative Commons license. Wiktionary is a great resource. If you like it too, please donate to Wikimedia.

This entry was last updated on RefTopia from its source on 3/20/2012.