1.1 --- a/lemon/preflow.h Sat Mar 16 14:11:32 2013 +0100
1.2 +++ b/lemon/preflow.h Mon Mar 18 17:41:19 2013 +0100
1.3 @@ -102,8 +102,8 @@
1.4 ///
1.5 /// This class provides an implementation of Goldberg-Tarjan's \e preflow
1.6 /// \e push-relabel algorithm producing a \ref max_flow
1.7 - /// "flow of maximum value" in a digraph \ref clrs01algorithms,
1.8 - /// \ref amo93networkflows, \ref goldberg88newapproach.
1.9 + /// "flow of maximum value" in a digraph \cite clrs01algorithms,
1.10 + /// \cite amo93networkflows, \cite goldberg88newapproach.
1.11 /// The preflow algorithms are the fastest known maximum
1.12 /// flow algorithms. The current implementation uses a mixture of the
1.13 /// \e "highest label" and the \e "bound decrease" heuristics.