1.1 --- a/lemon/kruskal.h	Tue Jul 19 12:40:23 2005 +0000
     1.2 +++ b/lemon/kruskal.h	Wed Jul 20 08:01:16 2005 +0000
     1.3 @@ -92,7 +92,7 @@
     1.4    /// also require <tt>Edge</tt>s instead of <tt>UndirEdge</tt>s, as some
     1.5    /// people would expect. So, one should be careful not to add both of the
     1.6    /// <tt>Edge</tt>s belonging to a certain <tt>UndirEdge</tt>.
     1.7 -  /// (\ref kruskalEdgeMap() and \ref KruskalMapInput are kind enough to do so.)
     1.8 +  /// (\ref kruskal() and \ref KruskalMapInput are kind enough to do so.)
     1.9  
    1.10  #ifdef DOXYGEN
    1.11    template <class GR, class IN, class OUT>
    1.12 @@ -187,7 +187,7 @@
    1.13   
    1.14    /// Kruskal's input source.
    1.15    ///
    1.16 -  /// In most cases you possibly want to use the \ref kruskalEdgeMap() instead.
    1.17 +  /// In most cases you possibly want to use the \ref kruskal() instead.
    1.18    ///
    1.19    /// \sa makeKruskalMapInput()
    1.20    ///
    1.21 @@ -254,7 +254,7 @@
    1.22    /// to explicitly give the type of the parameters.
    1.23    ///
    1.24    /// In most cases you possibly
    1.25 -  /// want to use the function kruskalEdgeMap() instead.
    1.26 +  /// want to use \ref kruskal() instead.
    1.27    ///
    1.28    ///\param g The type of the graph the algorithm runs on.
    1.29    ///\param m An edge map containing the cost of the edges.
    1.30 @@ -391,12 +391,12 @@
    1.31  //   we can put its edges into a STL vector \c tree with a code like this.
    1.32  //   \code
    1.33  //   std::vector<Edge> tree(53);
    1.34 -//   kruskalEdgeMap_IteratorOut(g,cost,tree.begin());
    1.35 +//   kruskal(g,cost,tree.begin());
    1.36  //   \endcode
    1.37  //   Or if we don't know in advance the size of the tree, we can write this.
    1.38  //   \code
    1.39  //   std::vector<Edge> tree;
    1.40 -//   kruskalEdgeMap_IteratorOut(g,cost,std::back_inserter(tree));
    1.41 +//   kruskal(g,cost,std::back_inserter(tree));
    1.42  //   \endcode
    1.43  //  
    1.44  //   \return The cost of the found tree.