Index: lemon/cycle_canceling.h
===================================================================
--- lemon/cycle_canceling.h (revision 1217)
+++ lemon/cycle_canceling.h (revision 1221)
@@ -48,6 +48,6 @@
/// \ref CycleCanceling implements three different cycle-canceling
/// algorithms for finding a \ref min_cost_flow "minimum cost flow"
- /// \ref amo93networkflows, \ref klein67primal,
- /// \ref goldberg89cyclecanceling.
+ /// \cite amo93networkflows, \cite klein67primal,
+ /// \cite goldberg89cyclecanceling.
/// The most efficent one is the \ref CANCEL_AND_TIGHTEN
/// "Cancel-and-Tighten" algorithm, thus it is the default method.
@@ -132,5 +132,5 @@
/// The "Minimum Mean Cycle-Canceling" algorithm, which is a
/// well-known strongly polynomial method
- /// \ref goldberg89cyclecanceling. It improves along a
+ /// \cite goldberg89cyclecanceling. It improves along a
/// \ref min_mean_cycle "minimum mean cycle" in each iteration.
/// Its running time complexity is O(n2e3log(n)).
@@ -138,5 +138,5 @@
/// The "Cancel-and-Tighten" algorithm, which can be viewed as an
/// improved version of the previous method
- /// \ref goldberg89cyclecanceling.
+ /// \cite goldberg89cyclecanceling.
/// It is faster both in theory and in practice, its running time
/// complexity is O(n2e2log(n)).