diff -r e30a0fdad0d7 -r 0ed45a6c74b1 lemon/johnson.h
--- a/lemon/johnson.h	Tue Feb 20 15:53:33 2007 +0000
+++ b/lemon/johnson.h	Wed Feb 21 13:30:21 2007 +0000
@@ -19,7 +19,7 @@
 #ifndef LEMON_JOHNSON_H
 #define LEMON_JOHNSON_H
 
-///\ingroup flowalgs
+///\ingroup shortest_path
 /// \file
 /// \brief Johnson algorithm.
 ///
@@ -180,7 +180,7 @@
 
   /// \brief %Johnson algorithm class.
   ///
-  /// \ingroup flowalgs
+  /// \ingroup shortest_path
   /// This class provides an efficient implementation of \c %Johnson 
   /// algorithm. The edge lengths are passed to the algorithm using a
   /// \ref concepts::ReadMap "ReadMap", so it is easy to change it to any