1.1 --- a/lemon/bellman_ford.h	Tue Feb 20 15:53:33 2007 +0000
     1.2 +++ b/lemon/bellman_ford.h	Wed Feb 21 13:30:21 2007 +0000
     1.3 @@ -19,7 +19,7 @@
     1.4  #ifndef LEMON_BELMANN_FORD_H
     1.5  #define LEMON_BELMANN_FORD_H
     1.6  
     1.7 -/// \ingroup flowalgs
     1.8 +/// \ingroup shortest_path
     1.9  /// \file
    1.10  /// \brief BellmanFord algorithm.
    1.11  ///
    1.12 @@ -144,7 +144,7 @@
    1.13    
    1.14    /// \brief %BellmanFord algorithm class.
    1.15    ///
    1.16 -  /// \ingroup flowalgs
    1.17 +  /// \ingroup shortest_path
    1.18    /// This class provides an efficient implementation of \c Bellman-Ford 
    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 
    1.21 @@ -1022,7 +1022,7 @@
    1.22    
    1.23    /// \brief Function type interface for BellmanFord algorithm.
    1.24    ///
    1.25 -  /// \ingroup flowalgs
    1.26 +  /// \ingroup shortest_path
    1.27    /// Function type interface for BellmanFord algorithm.
    1.28    ///
    1.29    /// This function also has several \ref named-templ-func-param