Arborescence (graph theory)
http://dbpedia.org/resource/Arborescence_(graph_theory) an entity of type: Software
Ein Out-Tree ist in der Graphentheorie ein spezieller Graph, genauer ein gewurzelter Baum, bei dem die Kanten von der Wurzel ausgehen.
rdf:langString
在圖論內，樹狀圖（arborescence）是一個有向图；並且，對其中一個我們稱呼作根的頂點，以及任何其他頂點，此圖必然存在且只存在一條從到的路徑。換句話說，樹狀圖是一個有向的，有根的樹，並且所有的邊都指離根的方向。所有的樹狀圖都是一個有向无环图。
rdf:langString
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.
rdf:langString
rdf:langString
Out-Tree
rdf:langString
Arborescence (graph theory)
rdf:langString
Arborescenza
rdf:langString
樹狀圖
xsd:integer
13251077
xsd:integer
1096719629
rdf:langString
Arborescence
rdf:langString
Rooted Tree
rdf:langString
Arborescence
rdf:langString
RootedTree
rdf:langString
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.
rdf:langString
Ein Out-Tree ist in der Graphentheorie ein spezieller Graph, genauer ein gewurzelter Baum, bei dem die Kanten von der Wurzel ausgehen.
rdf:langString
在圖論內，樹狀圖（arborescence）是一個有向图；並且，對其中一個我們稱呼作根的頂點，以及任何其他頂點，此圖必然存在且只存在一條從到的路徑。換句話說，樹狀圖是一個有向的，有根的樹，並且所有的邊都指離根的方向。所有的樹狀圖都是一個有向无环图。
xsd:nonNegativeInteger
7209