diff -r 572bc7d0d3e2 -r 48769ac7ec32 lemon/kruskal.h
--- a/lemon/kruskal.h	Wed Jul 13 14:17:13 2005 +0000
+++ b/lemon/kruskal.h	Wed Jul 13 19:49:36 2005 +0000
@@ -45,8 +45,11 @@
   /// Kruskal's algorithm to find a minimum cost tree of a graph.
 
   /// This function runs Kruskal's algorithm to find a minimum cost tree.
-  /// \param g The graph the algorithm runs on. The algorithm considers the
-  /// graph to be undirected, the direction of the edges are not used.
+  /// \param g The graph the algorithm runs on.
+  /// It can be either \ref concept::StaticGraph "directed" or 
+  /// \ref concept::UndirStaticGraph "undirected".
+  /// If the graph is directed, the algorithm consider it to be 
+  /// undirected by disregarding the direction of the edges.
   ///
   /// \param in This object is used to describe the edge costs. It must
   /// be an STL compatible 'Forward Container'