bn:00972168n
Noun Concept
Categories: Trees (graph theory), Directed acyclic graphs
EN
polytree  directed tree  oriented tree  polyforest  singly connected network
EN
In mathematics, and more specifically in graph theory, a polytree is a directed acyclic graph whose underlying undirected graph is a tree. Wikipedia
Definitions
Relations
Sources
EN
In mathematics, and more specifically in graph theory, a polytree is a directed acyclic graph whose underlying undirected graph is a tree. Wikipedia
A directed graph without any undirected cycles Wikipedia Disambiguation
directed acyclic graph whose underlying undirected graph is a tree Wikidata
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. Wiktionary
Wikipedia
Wikidata
Wiktionary
Wikipedia Redirections