diff -r 05c0ba99cc27 -r 616c019215c4 lemon/goldberg_tarjan.h
--- a/lemon/goldberg_tarjan.h	Sun Nov 25 22:56:44 2007 +0000
+++ b/lemon/goldberg_tarjan.h	Tue Nov 27 15:41:43 2007 +0000
@@ -103,13 +103,13 @@
   /// of the Goldberg's \ref Preflow "preflow" algorithm by using the \ref
   /// DynamicTree "dynamic tree" data structure of Sleator and Tarjan.
   /// 
-  /// The original preflow algorithm with \e "highest label" or \e
-  /// FIFO heuristic has \f$O(n^3)\f$ time complexity. The current
-  /// algorithm improved this complexity to
-  /// \f$O(nm\log(\frac{n^2}{m}))\f$. The algorithm builds limited
-  /// size dynamic trees on the residual graph, which can be used to
-  /// make multilevel push operations and gives a better bound on the
-  /// number of non-saturating pushes.
+  /// The original preflow algorithm with \e highest \e label
+  /// heuristic has \f$O(n^2\sqrt{e})\f$ or with \e FIFO heuristic has
+  /// \f$O(n^3)\f$ time complexity. The current algorithm improved
+  /// this complexity to \f$O(nm\log(\frac{n^2}{m}))\f$. The algorithm
+  /// builds limited size dynamic trees on the residual graph, which
+  /// can be used to make multilevel push operations and gives a
+  /// better bound on the number of non-saturating pushes.
   ///
   /// \param Graph The directed graph type the algorithm runs on.
   /// \param CapacityMap The capacity map type.
@@ -965,11 +965,12 @@
 
     /// @}
 
-    /// \name Query Functions
-    /// The result of the %Dijkstra algorithm can be obtained using these
-    /// functions.\n
-    /// Before the use of these functions,
-    /// either run() or start() must be called.
+    /// \name Query Functions 
+    /// The result of the Goldberg-Tarjan algorithm can be obtained
+    /// using these functions.
+    /// \n
+    /// Before the use of these functions, either run() or start() must
+    /// be called.
     
     ///@{