Spanning tree minimum or tree spanning in the graph, the value (weight) can be built.

suppose the graph a graph is connective. (i.e. between two distinct vertices that a path exist), the order of a Spanning Tree of this graph is a tree that contains all vertices of this graph, but only some of the mane, it includes. The order of Spanning Tree minimum (for graph, the connective weight) is a tree that, tree, spanning it, the graph, the total weight of the Mane, and it is the lowest possible amount.To obtain a Spanning Tree optimized a graph are connected can be seen from the algorithm, different used.Three algorithms, known find spanning tree minimum include : the algorithm of Kruskal., the algorithm, prim., the algorithm (Sulin), the algorithm remove the reverse

in the issues that the goal of creating a network is to establish a relationship between any two members of its cost, must be addressed and well end up in the network between any two members of the communication ... spanning tree minimum, the same low-cost most network. For example, suppose in a country we want, so the road-building that can be seen from every city to every city another visit and the cost of the construction of the road between any two cities, we have(this cost can be a function based on the distance of 2 City, the climate between the two cities, the distance they are from the company, the way storage and ...). To find the most cost the way, should spanning tree minimum find.

in the algorithm Mane graph to the Ascending Sort. From the first (smallest) Mane started and any edges to the graph we add the condition that the round in the graph created is not. This routine will so continue until the Spanning Tree, the optimal form.

This algorithm the algorithm of prim for finding spanning tree minimum of a graph to who goes.This algorithm weight most weight sort can Mane established order selected .Operation when the terminate can make all the helm of the established time connected the number of edges contained in F equal to n-1 that n is the number of vertices. That in some books with the name of The raised.