An Entity of Type: software, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In graph theory, an arborescence is a directed graph in which, for a vertex u (called the root) and any other vertex v, there is exactly one directed path from u to v. An arborescence is thus the directed-graph form of a rooted tree, understood here as an undirected graph. Equivalently, an arborescence is a directed, rooted tree in which all edges point away from the root; a number of other equivalent characterizations exist. Every arborescence is a directed acyclic graph (DAG), but not every DAG is an arborescence.

Property Value
dbo:abstract
  • In graph theory, an arborescence is a directed graph in which, for a vertex u (called the root) and any other vertex v, there is exactly one directed path from u to v. An arborescence is thus the directed-graph form of a rooted tree, understood here as an undirected graph. Equivalently, an arborescence is a directed, rooted tree in which all edges point away from the root; a number of other equivalent characterizations exist. Every arborescence is a directed acyclic graph (DAG), but not every DAG is an arborescence. An arborescence can equivalently be defined as a rooted digraph in which the path from the root to any other vertex is unique. (en)
  • Ein Out-Tree ist in der Graphentheorie ein spezieller Graph, genauer ein gewurzelter Baum, bei dem die Kanten von der Wurzel ausgehen. (de)
  • 在圖論內,樹狀圖(arborescence)是一個有向图;並且,對其中一個我們稱呼作根的頂點,以及任何其他頂點,此圖必然存在且只存在一條從到的路徑。換句話說,樹狀圖是一個有向的,有根的樹,並且所有的邊都指離根的方向。所有的樹狀圖都是一個有向无环图。 (zh)
dbo:wikiPageID
  • 13251077 (xsd:integer)
dbo:wikiPageLength
  • 7209 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1096719629 (xsd:integer)
dbo:wikiPageWikiLink
dbp:title
  • Arborescence (en)
  • Rooted Tree (en)
dbp:urlname
  • Arborescence (en)
  • RootedTree (en)
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • Ein Out-Tree ist in der Graphentheorie ein spezieller Graph, genauer ein gewurzelter Baum, bei dem die Kanten von der Wurzel ausgehen. (de)
  • 在圖論內,樹狀圖(arborescence)是一個有向图;並且,對其中一個我們稱呼作根的頂點,以及任何其他頂點,此圖必然存在且只存在一條從到的路徑。換句話說,樹狀圖是一個有向的,有根的樹,並且所有的邊都指離根的方向。所有的樹狀圖都是一個有向无环图。 (zh)
  • In graph theory, an arborescence is a directed graph in which, for a vertex u (called the root) and any other vertex v, there is exactly one directed path from u to v. An arborescence is thus the directed-graph form of a rooted tree, understood here as an undirected graph. Equivalently, an arborescence is a directed, rooted tree in which all edges point away from the root; a number of other equivalent characterizations exist. Every arborescence is a directed acyclic graph (DAG), but not every DAG is an arborescence. (en)
rdfs:label
  • Out-Tree (de)
  • Arborescence (graph theory) (en)
  • Arborescenza (it)
  • 樹狀圖 (zh)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License