1.1 --- a/lemon/dijkstra.h	Tue Feb 20 15:53:33 2007 +0000
     1.2 +++ b/lemon/dijkstra.h	Wed Feb 21 13:30:21 2007 +0000
     1.3 @@ -19,7 +19,7 @@
     1.4  #ifndef LEMON_DIJKSTRA_H
     1.5  #define LEMON_DIJKSTRA_H
     1.6  
     1.7 -///\ingroup flowalgs
     1.8 +///\ingroup shortest_path
     1.9  ///\file
    1.10  ///\brief Dijkstra algorithm.
    1.11  ///
    1.12 @@ -140,7 +140,7 @@
    1.13    
    1.14    ///%Dijkstra algorithm class.
    1.15    
    1.16 -  /// \ingroup flowalgs
    1.17 +  /// \ingroup shortest_path
    1.18    ///This class provides an efficient implementation of %Dijkstra algorithm.
    1.19    ///The edge lengths are passed to the algorithm using a
    1.20    ///\ref concepts::ReadMap "ReadMap",
    1.21 @@ -1107,7 +1107,7 @@
    1.22    
    1.23    ///Function type interface for Dijkstra algorithm.
    1.24  
    1.25 -  /// \ingroup flowalgs
    1.26 +  /// \ingroup shortest_path
    1.27    ///Function type interface for Dijkstra algorithm.
    1.28    ///
    1.29    ///This function also has several