# HG changeset patch
# User athos
# Date 1122025280 0
# Node ID a9e4208cf4e353f945742962e35b30041cc2e544
# Parent  ed7da82bbecf105fff33dc0e9fbd0f48c5dc2485
Some changes to kruskal stuff.

diff -r ed7da82bbecf -r a9e4208cf4e3 demo/kruskal_demo.cc
--- a/demo/kruskal_demo.cc	Thu Jul 21 19:28:29 2005 +0000
+++ b/demo/kruskal_demo.cc	Fri Jul 22 09:41:20 2005 +0000
@@ -93,7 +93,7 @@
   //The vector for the edges of the output tree.
   tree_edge_vec.clear();
 
-  //Test with makeKruskalSequenceOutput and makeKruskalSequenceOutput.
+  //Test with makeKruskalMapInput and makeKruskalSequenceOutput.
 
   std::cout << "The weight of the minimum spanning tree again is " << 
    kruskal(g,makeKruskalMapInput(g,edge_cost_map_2),makeKruskalSequenceOutput(std::back_inserter(tree_edge_vec)))<< std::endl;
diff -r ed7da82bbecf -r a9e4208cf4e3 doc/quicktour.dox
--- a/doc/quicktour.dox	Thu Jul 21 19:28:29 2005 +0000
+++ b/doc/quicktour.dox	Fri Jul 22 09:41:20 2005 +0000
@@ -2,8 +2,7 @@
 
 \page quicktour Quick Tour to LEMON
 
-Let us first answer the question <b>"What do I want to use LEMON for?"
-</b>. 
+Let us first answer the question <b>"What do I want to use LEMON for?"</b>. 
 LEMON is a C++ library, so you can use it if you want to write C++ 
 programs. What kind of tasks does the library LEMON help to solve? 
 It helps to write programs that solve optimization problems that arise
@@ -146,15 +145,16 @@
 tree</b> in an undirected graph. This can be found using the Kruskal
 algorithm: the function \ref lemon::kruskal "LEMON Kruskal " does
 this job for you.  After we had a graph \c g and a cost map \c
-edge_cost_map , the following code fragment shows an example how to get weight of the minmum spanning tree, if the costs are uniform:
+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):
 
 \dontinclude kruskal_demo.cc
 \skip std::cout 
 \until kruskal
 
-It gives back a edge bool map, which contains the edges of the tree.
+In the variable \c tree_map the function gives back an edge bool map, which contains the edges of the found tree.
+
 If the costs are non-uniform, for example  the cost is given by \c
-edge_cost_map_2 , or the edges of the tree are have to be given in a
+edge_cost_map_2 , or the edges of the tree  have to be given in a
 vector, then we can give to the kruskal a vector \c tree_edge_vec , instead of
 an edge bool map: