diff -r f67737f5727a -r e15162d8eca1 lemon/kruskal.h
--- a/lemon/kruskal.h	Tue Aug 16 16:44:57 2005 +0000
+++ b/lemon/kruskal.h	Tue Aug 16 19:06:59 2005 +0000
@@ -51,7 +51,7 @@
   ///
   /// \param g The graph the algorithm runs on.
   /// It can be either \ref concept::StaticGraph "directed" or 
-  /// \ref concept::UndirStaticGraph "undirected".
+  /// \ref concept::UndirGraph "undirected".
   /// If the graph is directed, the algorithm consider it to be 
   /// undirected by disregarding the direction of the edges.
   ///
@@ -88,7 +88,8 @@
   ///
   /// \return The cost of the found tree.
   ///
-  /// \warning If kruskal is run on an \ref undirected graph, be sure that the
+  /// \warning If kruskal is run on an
+  /// \ref lemon::concept::UndirGraph "undirected graph", be sure that the
   /// map storing the tree is also undirected
   /// (e.g. UndirListGraph::UndirEdgeMap<bool>, otherwise the values of the
   /// half of the edges will not be set.