1.1 --- a/lemon/dijkstra.h	Thu Jan 25 14:38:55 2007 +0000
     1.2 +++ b/lemon/dijkstra.h	Tue Feb 06 19:09:17 2007 +0000
     1.3 @@ -510,6 +510,9 @@
     1.4      }
     1.5  
     1.6    public:
     1.7 +
     1.8 +    typedef PredMapPath<Graph, PredMap> Path;
     1.9 +
    1.10      ///\name Execution control
    1.11      ///The simplest way to execute the algorithm is to use
    1.12      ///one of the member functions called \c run(...).
    1.13 @@ -719,8 +722,6 @@
    1.14      
    1.15      ///@{
    1.16  
    1.17 -    typedef PredMapPath<Graph, PredMap> Path;
    1.18 -
    1.19      ///Gives back the shortest path.
    1.20      
    1.21      ///Gives back the shortest path.

     2.1 --- a/lemon/kruskal.h	Thu Jan 25 14:38:55 2007 +0000
     2.2 +++ b/lemon/kruskal.h	Tue Feb 06 19:09:17 2007 +0000
     2.3 @@ -31,7 +31,6 @@
     2.4  ///
     2.5  ///Kruskal's algorithm to compute a minimum cost tree.
     2.6  ///
     2.7 -///\todo The file still needs some clean-up.
     2.8  
     2.9  namespace lemon {
    2.10  
    2.11 @@ -88,15 +87,10 @@
    2.12    /// (e.g. ListUGraph::UEdgeMap<bool>, otherwise the values of the
    2.13    /// half of the edges will not be set.
    2.14    ///
    2.15 -  /// \todo Discuss the case of undirected graphs: In this case the algorithm
    2.16 -  /// also require <tt>Edge</tt>s instead of <tt>UEdge</tt>s, as some
    2.17 -  /// people would expect. So, one should be careful not to add both of the
    2.18 -  /// <tt>Edge</tt>s belonging to a certain <tt>UEdge</tt>.
    2.19 -  /// (\ref kruskal() and \ref KruskalMapInput are kind enough to do so.)
    2.20  
    2.21  #ifdef DOXYGEN
    2.22    template <class GR, class IN, class OUT>
    2.23 -  typename IN::value_type::second_type
    2.24 +  CostType
    2.25    kruskal(GR const& g, IN const& in, 
    2.26  	  OUT& out)
    2.27  #else