1.1 --- a/lemon/edmonds_karp.h	Tue Jul 30 15:54:46 2013 +0200
     1.2 +++ b/lemon/edmonds_karp.h	Mon Aug 05 14:03:29 2013 +0200
     1.3 @@ -80,8 +80,8 @@
     1.4    ///
     1.5    /// This class provides an implementation of the \e Edmonds-Karp \e
     1.6    /// algorithm producing a \ref max_flow "flow of maximum value" in a
     1.7 -  /// digraph \ref clrs01algorithms, \ref amo93networkflows,
     1.8 -  /// \ref edmondskarp72theoretical.
     1.9 +  /// digraph \cite clrs01algorithms, \cite amo93networkflows,
    1.10 +  /// \cite edmondskarp72theoretical.
    1.11    /// The Edmonds-Karp algorithm is slower than the Preflow
    1.12    /// algorithm, but it has an advantage of the step-by-step execution
    1.13    /// control with feasible flow solutions. The \e source node, the \e
    1.14 @@ -112,7 +112,8 @@
    1.15    class EdmondsKarp {
    1.16    public:
    1.17  
    1.18 -    /// The \ref EdmondsKarpDefaultTraits "traits class" of the algorithm.
    1.19 +    /// \brief The \ref lemon::EdmondsKarpDefaultTraits "traits class"
    1.20 +    /// of the algorithm.
    1.21      typedef TR Traits;
    1.22      /// The type of the digraph the algorithm runs on.
    1.23      typedef typename Traits::Digraph Digraph;