1.1 --- a/lemon/goldberg_tarjan.h	Sun Nov 25 22:56:44 2007 +0000
     1.2 +++ b/lemon/goldberg_tarjan.h	Tue Nov 27 15:41:43 2007 +0000
     1.3 @@ -103,13 +103,13 @@
     1.4    /// of the Goldberg's \ref Preflow "preflow" algorithm by using the \ref
     1.5    /// DynamicTree "dynamic tree" data structure of Sleator and Tarjan.
     1.6    /// 
     1.7 -  /// The original preflow algorithm with \e "highest label" or \e
     1.8 -  /// FIFO heuristic has \f$O(n^3)\f$ time complexity. The current
     1.9 -  /// algorithm improved this complexity to
    1.10 -  /// \f$O(nm\log(\frac{n^2}{m}))\f$. The algorithm builds limited
    1.11 -  /// size dynamic trees on the residual graph, which can be used to
    1.12 -  /// make multilevel push operations and gives a better bound on the
    1.13 -  /// number of non-saturating pushes.
    1.14 +  /// The original preflow algorithm with \e highest \e label
    1.15 +  /// heuristic has \f$O(n^2\sqrt{e})\f$ or with \e FIFO heuristic has
    1.16 +  /// \f$O(n^3)\f$ time complexity. The current algorithm improved
    1.17 +  /// this complexity to \f$O(nm\log(\frac{n^2}{m}))\f$. The algorithm
    1.18 +  /// builds limited size dynamic trees on the residual graph, which
    1.19 +  /// can be used to make multilevel push operations and gives a
    1.20 +  /// better bound on the number of non-saturating pushes.
    1.21    ///
    1.22    /// \param Graph The directed graph type the algorithm runs on.
    1.23    /// \param CapacityMap The capacity map type.
    1.24 @@ -965,11 +965,12 @@
    1.25  
    1.26      /// @}
    1.27  
    1.28 -    /// \name Query Functions
    1.29 -    /// The result of the %Dijkstra algorithm can be obtained using these
    1.30 -    /// functions.\n
    1.31 -    /// Before the use of these functions,
    1.32 -    /// either run() or start() must be called.
    1.33 +    /// \name Query Functions 
    1.34 +    /// The result of the Goldberg-Tarjan algorithm can be obtained
    1.35 +    /// using these functions.
    1.36 +    /// \n
    1.37 +    /// Before the use of these functions, either run() or start() must
    1.38 +    /// be called.
    1.39      
    1.40      ///@{
    1.41