polytree
Sign in to saveAlso known as oriented tree, singly connected network, directed tree
thumb|A polytree In mathematics, and more specifically in graph theory, a polytree (also called directed tree, oriented tree or singly connected network) is a directed acyclic graph whose underlying undirected graph is a tree. In other words, a polytree is formed by assigning an orientation to each edge of a connected and acyclic undirected graph.
~3 min read
Encyclopedic overview
7 sectionsContents
- Related structures
- Enumeration
- Sumner's conjecture
- Applications
- See also
- Notes
- References
thumb|A polytree In mathematics, and more specifically in graph theory, a polytree (also called directed tree, oriented tree or singly connected network) is a directed acyclic graph whose underlying undirected graph is a tree. In other words, a polytree is formed by assigning an orientation to each edge of a connected and acyclic undirected graph.
A polyforest (or directed forest or oriented forest) is a directed acyclic graph whose underlying undirected graph is a forest. In other words, if we replace its directed edges with undirected edges, we obtain an undirected graph that is acyclic.
Excerpted from Wikipedia’s “polytree” article, available under the CC BY-SA 4.0 licence.