1.1 --- a/lemon/kruskal.h	Mon Jul 14 10:55:43 2008 +0100
     1.2 +++ b/lemon/kruskal.h	Mon Jul 14 15:40:24 2008 +0100
     1.3 @@ -300,9 +300,8 @@
     1.4    ///
     1.5    /// \return The total cost of the found spanning tree.
     1.6    ///
     1.7 -  /// \warning If Kruskal runs on an be consistent of using the same
     1.8 -  /// Arc type for input and output.
     1.9 -  ///
    1.10 +  /// \note If the input graph is not (weakly) connected, a spanning 
    1.11 +  /// forest is calculated instead of a spanning tree.
    1.12  
    1.13  #ifdef DOXYGEN
    1.14    template <class Graph, class In, class Out>