1.1 --- a/demo/kruskal_demo.cc	Thu Jul 21 19:28:29 2005 +0000
     1.2 +++ b/demo/kruskal_demo.cc	Fri Jul 22 09:41:20 2005 +0000
     1.3 @@ -93,7 +93,7 @@
     1.4    //The vector for the edges of the output tree.
     1.5    tree_edge_vec.clear();
     1.6  
     1.7 -  //Test with makeKruskalSequenceOutput and makeKruskalSequenceOutput.
     1.8 +  //Test with makeKruskalMapInput and makeKruskalSequenceOutput.
     1.9  
    1.10    std::cout << "The weight of the minimum spanning tree again is " << 
    1.11     kruskal(g,makeKruskalMapInput(g,edge_cost_map_2),makeKruskalSequenceOutput(std::back_inserter(tree_edge_vec)))<< std::endl;

     2.1 --- a/doc/quicktour.dox	Thu Jul 21 19:28:29 2005 +0000
     2.2 +++ b/doc/quicktour.dox	Fri Jul 22 09:41:20 2005 +0000
     2.3 @@ -2,8 +2,7 @@
     2.4  
     2.5  \page quicktour Quick Tour to LEMON
     2.6  
     2.7 -Let us first answer the question <b>"What do I want to use LEMON for?"
     2.8 -</b>. 
     2.9 +Let us first answer the question <b>"What do I want to use LEMON for?"</b>. 
    2.10  LEMON is a C++ library, so you can use it if you want to write C++ 
    2.11  programs. What kind of tasks does the library LEMON help to solve? 
    2.12  It helps to write programs that solve optimization problems that arise
    2.13 @@ -146,15 +145,16 @@
    2.14  tree</b> in an undirected graph. This can be found using the Kruskal
    2.15  algorithm: the function \ref lemon::kruskal "LEMON Kruskal " does
    2.16  this job for you.  After we had a graph \c g and a cost map \c
    2.17 -edge_cost_map , the following code fragment shows an example how to get weight of the minmum spanning tree, if the costs are uniform:
    2.18 +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):
    2.19  
    2.20  \dontinclude kruskal_demo.cc
    2.21  \skip std::cout 
    2.22  \until kruskal
    2.23  
    2.24 -It gives back a edge bool map, which contains the edges of the tree.
    2.25 +In the variable \c tree_map the function gives back an edge bool map, which contains the edges of the found tree.
    2.26 +
    2.27  If the costs are non-uniform, for example  the cost is given by \c
    2.28 -edge_cost_map_2 , or the edges of the tree are have to be given in a
    2.29 +edge_cost_map_2 , or the edges of the tree  have to be given in a
    2.30  vector, then we can give to the kruskal a vector \c tree_edge_vec , instead of
    2.31  an edge bool map:
    2.32