1.1 --- a/lemon/kruskal.h	Thu Jan 25 14:38:55 2007 +0000
     1.2 +++ b/lemon/kruskal.h	Tue Feb 06 19:09:17 2007 +0000
     1.3 @@ -31,7 +31,6 @@
     1.4  ///
     1.5  ///Kruskal's algorithm to compute a minimum cost tree.
     1.6  ///
     1.7 -///\todo The file still needs some clean-up.
     1.8  
     1.9  namespace lemon {
    1.10  
    1.11 @@ -88,15 +87,10 @@
    1.12    /// (e.g. ListUGraph::UEdgeMap<bool>, otherwise the values of the
    1.13    /// half of the edges will not be set.
    1.14    ///
    1.15 -  /// \todo Discuss the case of undirected graphs: In this case the algorithm
    1.16 -  /// also require <tt>Edge</tt>s instead of <tt>UEdge</tt>s, as some
    1.17 -  /// people would expect. So, one should be careful not to add both of the
    1.18 -  /// <tt>Edge</tt>s belonging to a certain <tt>UEdge</tt>.
    1.19 -  /// (\ref kruskal() and \ref KruskalMapInput are kind enough to do so.)
    1.20  
    1.21  #ifdef DOXYGEN
    1.22    template <class GR, class IN, class OUT>
    1.23 -  typename IN::value_type::second_type
    1.24 +  CostType
    1.25    kruskal(GR const& g, IN const& in, 
    1.26  	  OUT& out)
    1.27  #else