1.1 --- a/lemon/floyd_warshall.h	Tue Feb 20 15:53:33 2007 +0000
     1.2 +++ b/lemon/floyd_warshall.h	Wed Feb 21 13:30:21 2007 +0000
     1.3 @@ -19,7 +19,7 @@
     1.4  #ifndef LEMON_FLOYD_WARSHALL_H
     1.5  #define LEMON_FLOYD_WARSHALL_H
     1.6  
     1.7 -///\ingroup flowalgs
     1.8 +///\ingroup shortest_path
     1.9  /// \file
    1.10  /// \brief FloydWarshall algorithm.
    1.11  ///
    1.12 @@ -147,7 +147,7 @@
    1.13    
    1.14    /// \brief %FloydWarshall algorithm class.
    1.15    ///
    1.16 -  /// \ingroup flowalgs
    1.17 +  /// \ingroup shortest_path
    1.18    /// This class provides an efficient implementation of \c Floyd-Warshall 
    1.19    /// algorithm. The edge lengths are passed to the algorithm using a
    1.20    /// \ref concepts::ReadMap "ReadMap", so it is easy to change it to any