Spanning tree
In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G. In general, a graph may have several spanning trees, but a graph that is not connected will not contain a spanning tree (but see below). If all of the edges of G are also edges of a spanning tree T of G, then G is a tree and is identical to T (that is, a tree has a unique spanning tree and it is itself).
primaryTopic
Spanning tree
In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G. In general, a graph may have several spanning trees, but a graph that is not connected will not contain a spanning tree (but see below). If all of the edges of G are also edges of a spanning tree T of G, then G is a tree and is identical to T (that is, a tree has a unique spanning tree and it is itself).
has abstract
25بك هذه المقالة تحتاج للمزيد ...... ن G عباره عن شجره مماثله ل T .
@ar
Dans le domaine mathématique d ...... aphe couvrant connexe minimal.
@fr
Drzewo rozpinające (ang. Spann ...... rozpinające w tym samym grafie
@pl
Ein Spannbaum (auch aufspannen ...... in zusammenhängenden Graphen.
@de
En teoría de grafos, un árbol ...... pansión de la mínima dilación.
@es
In the mathematical field of g ...... anning tree and it is itself).
@en
Uma árvore de extensão ou árvo ...... o algoritmo de Kruskal (1956).
@pt
Un albero di copertura o alber ...... ne inglese spanning tree (ST).
@it
Остовное дерево — ациклический ...... ва о́стов) или на второй слог.
@ru
全域木(ぜんいきぎ、英: Spanning tree)、極大 ...... のグラフを構成する辺の一部分のみで構成される木のことである。
@ja
thumbnail
Wikipage page ID
Wikipage revision ID
742,855,805
hypernym
comment
25بك هذه المقالة تحتاج للمزيد ...... ن G عباره عن شجره مماثله ل T .
@ar
Dans le domaine mathématique d ...... aphe couvrant connexe minimal.
@fr
Drzewo rozpinające (ang. Spann ...... rozpinające w tym samym grafie
@pl
Ein Spannbaum (auch aufspannen ...... in zusammenhängenden Graphen.
@de
En teoría de grafos, un árbol ...... G deben estar contenidos en T.
@es
In the mathematical field of g ...... anning tree and it is itself).
@en
Uma árvore de extensão ou árvo ...... o algoritmo de Kruskal (1956).
@pt
Un albero di copertura o alber ...... grassetto che quelli sottili.
@it
Остовное дерево — ациклический ...... ь один из следующих подграфов:
@ru
全域木(ぜんいきぎ、英: Spanning tree)、極大 ...... のグラフを構成する辺の一部分のみで構成される木のことである。
@ja
label
Albero ricoprente
@it
Arbre couvrant
@fr
Drzewo rozpinające
@pl
Spannbaum
@de
Spanning tree
@en
Árbol de expansión
@es
Árvore de extensão
@pt
Остовное дерево
@ru
شجرة الامتداد
@ar
全域木
@ja