Spanning tree
Title: Spanning tree
Category: /Literature/English
Details: Words: 629 | Pages: 2 (approximately 235 words/page)
Spanning tree
Category: /Literature/English
Details: Words: 629 | Pages: 2 (approximately 235 words/page)
A spanning tree is an application of a network. There is another type of spanning tree called the minimum spanning tree. This data structure is used in many business applications. I will be discussing what a spanning tree is and what a minimum spanning tree is, and how they work. I will also discuss how spanning trees are used in every day business.
A spanning tree of a graph is just a subgraph that contains
showed first 75 words of 629 total
You are viewing only a small portion of the paper.
Please login or register to access the full copy.
Please login or register to access the full copy.
showed last 75 words of 629 total
path visiting some vertices more than once you can always drop some edges to get a tree. So the minimum spanning tree is less than the total weight, because it’s a minimization over a larger set.
In conclusion we have seen what a spanning tree is and what a minimum spanning tree is. These two types of trees are important to networking. You can see how important spanning trees are to every day business.