Index: lemon/kruskal.h
===================================================================
--- lemon/kruskal.h (revision 1557)
+++ lemon/kruskal.h (revision 1570)
@@ -93,5 +93,5 @@
/// people would expect. So, one should be careful not to add both of the
/// Edges belonging to a certain UndirEdge.
- /// (\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,5 +188,5 @@
/// 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,5 +255,5 @@
///
/// 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,10 +392,10 @@
// \code
// std::vector 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 tree;
-// kruskalEdgeMap_IteratorOut(g,cost,std::back_inserter(tree));
+// kruskal(g,cost,std::back_inserter(tree));
// \endcode
//