Definition
In mathematics, and more specifically in graph theory, a polytree 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.
Related concepts
Arborescence (graph theory)Bayesian networkBelief propagationConnectivity (graph theory)Contour treeCritical point (mathematics)Cycle (graph theory)Daniela KühnDavid SumnerDirected acyclic graphDiscrete Mathematics (journal)Fence (mathematics)Frank HararyFrank RuskeyGlossary of graph theoryGraph theoryGraphical modelJudea PearlLevel setMathematicsMultitreeOn-Line Encyclopedia of Integer SequencesOrder (journal)Order dimensionOrientation (graph theory)Partial orderProbabilistic reasoningProceedings of the London Mathematical SocietyReachabilityRodica SimionSumner's conjectureTournament (graph theory)Tree (graph theory)Universal graphVector spaceWilliam T. Trotter
6 concepts already in your glossary