Statements (25)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Graph Theory Concept
|
| gptkbp:application |
gptkb:Cluster_Analysis
gptkb:Network_Routing Redundancy Elimination Broadcasting in Networks Circuit Design |
| gptkbp:contrastsWith |
gptkb:Spanning_Forest
gptkb:Minimum_Spanning_Tree |
| gptkbp:definedIn |
A subgraph that is a tree and includes all the vertices of the original graph
|
| gptkbp:formedBy |
gptkb:Mathematics
Computer Science |
| https://www.w3.org/2000/01/rdf-schema#label |
Spanning Tree
|
| gptkbp:property |
Connects all vertices
Contains no cycles Has exactly n-1 edges for n vertices |
| gptkbp:relatedTo |
gptkb:tree
graph |
| gptkbp:supportsAlgorithm |
gptkb:Boruvka's_Algorithm
gptkb:Kruskal's_Algorithm gptkb:Prim's_Algorithm |
| gptkbp:usedIn |
gptkb:Minimum_Spanning_Tree_Algorithms
gptkb:Computer_Networks Network Design |
| gptkbp:bfsParent |
gptkb:Spanning_Tree_Algorithm
|
| gptkbp:bfsLayer |
6
|