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.