diff -r e30a0fdad0d7 -r 0ed45a6c74b1 lemon/dijkstra.h
--- a/lemon/dijkstra.h	Tue Feb 20 15:53:33 2007 +0000
+++ b/lemon/dijkstra.h	Wed Feb 21 13:30:21 2007 +0000
@@ -19,7 +19,7 @@
 #ifndef LEMON_DIJKSTRA_H
 #define LEMON_DIJKSTRA_H
 
-///\ingroup flowalgs
+///\ingroup shortest_path
 ///\file
 ///\brief Dijkstra algorithm.
 ///
@@ -140,7 +140,7 @@
   
   ///%Dijkstra algorithm class.
   
-  /// \ingroup flowalgs
+  /// \ingroup shortest_path
   ///This class provides an efficient implementation of %Dijkstra algorithm.
   ///The edge lengths are passed to the algorithm using a
   ///\ref concepts::ReadMap "ReadMap",
@@ -1107,7 +1107,7 @@
   
   ///Function type interface for Dijkstra algorithm.
 
-  /// \ingroup flowalgs
+  /// \ingroup shortest_path
   ///Function type interface for Dijkstra algorithm.
   ///
   ///This function also has several