COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
02/21/07 14:30:21 (13 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:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/bellman_ford.h

    r2362 r2376  
    2020#define LEMON_BELMANN_FORD_H
    2121
    22 /// \ingroup flowalgs
     22/// \ingroup shortest_path
    2323/// \file
    2424/// \brief BellmanFord algorithm.
     
    145145  /// \brief %BellmanFord algorithm class.
    146146  ///
    147   /// \ingroup flowalgs
     147  /// \ingroup shortest_path
    148148  /// This class provides an efficient implementation of \c Bellman-Ford
    149149  /// algorithm. The edge lengths are passed to the algorithm using a
     
    10231023  /// \brief Function type interface for BellmanFord algorithm.
    10241024  ///
    1025   /// \ingroup flowalgs
     1025  /// \ingroup shortest_path
    10261026  /// Function type interface for BellmanFord algorithm.
    10271027  ///
Note: See TracChangeset for help on using the changeset viewer.