diff -r 73c892335e74 -r 97d978243703 lemon/edmonds_karp.h
--- a/lemon/edmonds_karp.h	Tue Jul 30 15:54:46 2013 +0200
+++ b/lemon/edmonds_karp.h	Mon Aug 05 14:03:29 2013 +0200
@@ -80,8 +80,8 @@
   ///
   /// This class provides an implementation of the \e Edmonds-Karp \e
   /// algorithm producing a \ref max_flow "flow of maximum value" in a
-  /// digraph \ref clrs01algorithms, \ref amo93networkflows,
-  /// \ref edmondskarp72theoretical.
+  /// digraph \cite clrs01algorithms, \cite amo93networkflows,
+  /// \cite edmondskarp72theoretical.
   /// The Edmonds-Karp algorithm is slower than the Preflow
   /// algorithm, but it has an advantage of the step-by-step execution
   /// control with feasible flow solutions. The \e source node, the \e
@@ -112,7 +112,8 @@
   class EdmondsKarp {
   public:
 
-    /// The \ref EdmondsKarpDefaultTraits "traits class" of the algorithm.
+    /// \brief The \ref lemon::EdmondsKarpDefaultTraits "traits class"
+    /// of the algorithm.
     typedef TR Traits;
     /// The type of the digraph the algorithm runs on.
     typedef typename Traits::Digraph Digraph;