Changeset 1570:da93692e6537 in lemon-0.x for lemon/kruskal.h

Timestamp:

07/20/05 10:01:16 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2069

Message:

docfix

File:

• lemon/kruskal.h (modified) (4 diffs)

lemon/kruskal.h

@@ -93 +93 @@
   /// 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
@@ -188 +188 @@
   /// 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()
@@ -255 +255 @@
   ///
   /// 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.
@@ -392 +392 @@
 //   \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
 //