1.1 --- a/lemon/min_cut.h	Fri Apr 07 09:52:30 2006 +0000
     1.2 +++ b/lemon/min_cut.h	Fri Apr 07 09:54:35 2006 +0000
     1.3 @@ -839,9 +839,10 @@
     1.4    /// to test how many links have to be destroyed in the netaux to split it 
     1.5    /// at least two distinict subnetaux.
     1.6    ///
     1.7 -  /// The complexity of the algorithm is O(n*e*log(n)) but with Fibonacci 
     1.8 -  /// heap it can be decreased to O(n*e+n^2*log(n)). When the neutral capacity 
     1.9 -  /// map is used then it uses BucketHeap which results O(n*e) time complexity.
    1.10 +  /// The complexity of the algorithm is \f$ O(ne\log(n)) \f$ but with
    1.11 +  /// Fibonacci heap it can be decreased to \f$ O(ne+n^2\log(n)) \f$. When
    1.12 +  /// the neutral capacity map is used then it uses BucketHeap which
    1.13 +  /// results \f$ O(ne) \f$ time complexity.
    1.14  #ifdef DOXYGEN
    1.15    template <typename _Graph, typename _CapacityMap, typename _Traits>
    1.16  #else