COIN-OR::LEMON - Graph Library

Changeset 1250:97d978243703 in lemon for lemon/edmonds_karp.h


Ignore:
Timestamp:
08/05/13 14:03:29 (6 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Phase:
public
Message:

Fix unresolved doc references (#459)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/edmonds_karp.h

    r1229 r1250  
    8181  /// This class provides an implementation of the \e Edmonds-Karp \e
    8282  /// algorithm producing a \ref max_flow "flow of maximum value" in a
    83   /// digraph \ref clrs01algorithms, \ref amo93networkflows,
    84   /// \ref edmondskarp72theoretical.
     83  /// digraph \cite clrs01algorithms, \cite amo93networkflows,
     84  /// \cite edmondskarp72theoretical.
    8585  /// The Edmonds-Karp algorithm is slower than the Preflow
    8686  /// algorithm, but it has an advantage of the step-by-step execution
     
    113113  public:
    114114
    115     /// The \ref EdmondsKarpDefaultTraits "traits class" of the algorithm.
     115    /// \brief The \ref lemon::EdmondsKarpDefaultTraits "traits class"
     116    /// of the algorithm.
    116117    typedef TR Traits;
    117118    /// The type of the digraph the algorithm runs on.
Note: See TracChangeset for help on using the changeset viewer.