Spanning tree
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 all the vertices and is a tree. A graph may have many spanning trees for instance the complete graph on four vertices has sixteen spanning trees. A minimum spanning tree is a spanning tree in which the total weight of the lines is guaranteed to be the minimum of all possible trees in the graph. The weight of a tree is just the sum of weights of its edges, because different trees have different lengths you run in the problem of how to find the minimum length spanning tree. The problem can be solved by using an algorithm for the minimum spanning tree.
. . .
Some common words found in the essay are:
, spanning tree, minimum spanning, minimum spanning tree, spanning trees, algorithm minimum spanning, tree minimum spanning, sixteen spanning trees, sixteen spanning, prims algorithm, vertices tree, tree minimum, algorithm minimum, trees day business, contains vertices, path visiting,
Approximate Word count = 677
Approximate Pages = 3 (250 words per page double spaced)
|
 |
