Changeset 2376:0ed45a6c74b1 in lemon-0.x for lemon/bellman_ford.h

Timestamp:

02/21/07 14:30:21 (17 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3195

Message:

Reorganization of the modules and groups

File:

• lemon/bellman_ford.h (modified) (3 diffs)

lemon/bellman_ford.h

@@ -20 +20 @@
 #define LEMON_BELMANN_FORD_H
 
-/// \ingroup flowalgs
+/// \ingroup shortest_path
 /// \file
 /// \brief BellmanFord algorithm.
@@ -145 +145 @@
   /// \brief %BellmanFord algorithm class.
   ///
-  /// \ingroup flowalgs
+  /// \ingroup shortest_path
   /// This class provides an efficient implementation of \c Bellman-Ford 
   /// algorithm. The edge lengths are passed to the algorithm using a
@@ -1023 +1023 @@
   /// \brief Function type interface for BellmanFord algorithm.
   ///
-  /// \ingroup flowalgs
+  /// \ingroup shortest_path
   /// Function type interface for BellmanFord algorithm.
   ///