algorithm: the function \ref lemon::kruskal "LEMON Kruskal " does

 algorithm: the function \ref lemon::kruskal "LEMON Kruskal " does this

 this job for you.  After we had a graph \c g and a cost map \c

 job for you.  

 edge_cost_map , the following code fragment shows an example how to get weight of the minmum spanning tree (in this first example the costs are uniform; this is of course not the case in real life applications):

 First make a graph \c g and a cost map \c

 edge_cost_map, then make a bool edgemap \c tree_map or a vector \c

 tree_edge_vec for the algorithm output. After calling the function it

 gives back the weight of the minimum spanning tree and the \c tree_map or

 the \c tree_edge_vec contains the edges of the tree.

 If you want to store the edges in a bool edgemap, then use the

 function as follows:

 \skip std::cout 

 \skip Kruskal with boolmap; 

 \until kruskal

 \until  std::endl

 In the variable \c tree_map the function gives back an edge bool map, which contains the edges of the found tree.

 And if you rather use a vector instead of a bool map:

 If the costs are non-uniform, for example  the cost is given by \c

 \skip Kruskal with vector; 

 edge_cost_map_2 , or the edges of the tree  have to be given in a

 \until std::endl

 vector, then we can give to the kruskal a vector \c tree_edge_vec , instead of

 an edge bool map:

 \skip edge_cost_map_2 

 \until edge_cost_map_2, std::back_inserter

 And finally the next fragment shows how to use the functions \c makeKruskalMapInput and \c makeKruskalSequenceOutPut:

 \skip makeKruskalSequenceOutput

 \until tree_edge_vec