[Lemon-commits] [lemon_svn] alpar: r2069 - hugo/trunk/lemon

[Lemon SVN]

Author: alpar
Date: Wed Jul 20 10:01:16 2005
New Revision: 2069

Modified:
   hugo/trunk/lemon/kruskal.h

Log:
docfix

Modified: hugo/trunk/lemon/kruskal.h
==============================================================================
--- hugo/trunk/lemon/kruskal.h	(original)
+++ hugo/trunk/lemon/kruskal.h	Wed Jul 20 10:01:16 2005
@@ -92,7 +92,7 @@
   /// also require <tt>Edge</tt>s instead of <tt>UndirEdge</tt>s, as some
   /// people would expect. So, one should be careful not to add both of the
   /// <tt>Edge</tt>s belonging to a certain <tt>UndirEdge</tt>.
-  /// (\ref kruskalEdgeMap() and \ref KruskalMapInput are kind enough to do so.)
+  /// (\ref kruskal() and \ref KruskalMapInput are kind enough to do so.)
 
 #ifdef DOXYGEN
   template <class GR, class IN, class OUT>
@@ -187,7 +187,7 @@
  
   /// Kruskal's input source.
   ///
-  /// In most cases you possibly want to use the \ref kruskalEdgeMap() instead.
+  /// In most cases you possibly want to use the \ref kruskal() instead.
   ///
   /// \sa makeKruskalMapInput()
   ///
@@ -254,7 +254,7 @@
   /// to explicitly give the type of the parameters.
   ///
   /// In most cases you possibly
-  /// want to use the function kruskalEdgeMap() instead.
+  /// want to use \ref kruskal() instead.
   ///
   ///\param g The type of the graph the algorithm runs on.
   ///\param m An edge map containing the cost of the edges.
@@ -391,12 +391,12 @@
 //   we can put its edges into a STL vector \c tree with a code like this.
 //   \code
 //   std::vector<Edge> tree(53);
-//   kruskalEdgeMap_IteratorOut(g,cost,tree.begin());
+//   kruskal(g,cost,tree.begin());
 //   \endcode
 //   Or if we don't know in advance the size of the tree, we can write this.
 //   \code
 //   std::vector<Edge> tree;
-//   kruskalEdgeMap_IteratorOut(g,cost,std::back_inserter(tree));
+//   kruskal(g,cost,std::back_inserter(tree));
 //   \endcode
 //  
 //   \return The cost of the found tree.