spanning tree
subgraph of an undirected graph G that is a tree which includes all of the vertices of G
Facts
2 properties- Subclass of
- tree, undirected graph, spanning subgraph
- Studied by
- graph theory[4]
🏷️ Also known as
en spanning tree
ar شجرة الامتداد
cs minimální kostra grafu
cs minimální kostra
cs kostra grafu
da Udspændende træ
de Spanning Tree
de MCST
de Spannbaum-Algorithmus
de Aufspannender Baum
de Spannbaum
de Spannender Baum
de Minimaler Spannbaum
de Minimal spannender Baum
de Minimalgerüst
es árbol de expansión
es arbol recubridor
es arbol de expansion
es árbol de expansion
es arbol de expansión
🔖 Identifiers · 13
- Library of Congress Authorities ID
- sh2005003951
- OpenAlex ID
- C64331007
- Image (Wikimedia Commons)
- Spanning tree - version 1.jpg ↗
- BabelNet ID
- 03217203n
- Brilliant Wiki ID
- spanning-trees
- Dictionary of Algorithms and Data Structures ID
- spanningtree
- Freebase ID
- /m/02bn16
- J9U entity ID
- 987007551954805171
- MathWorld ID
- SpanningTree
- Microsoft Academic ID (discontinued)
- 64331007
- Quora topic ID
- Spanning-Tree
- ScienceDirect topic ID
- mathematics/spanning-tree, computer-science/spanning-tree, engineering/spanning-tree
Show all 13 identifiers +1
- Topic's main category
- Category:Spanning tree
🔗 Connections
Subclass of 2
Subtypes 2
Maintained by WikiProject 1
Studied by 1
Topic's main category 1
← Category's main topic 1
Press Enter · cited answer in seconds