1.1 --- a/lemon/hao_orlin.h	Mon Oct 30 16:19:18 2006 +0000
     1.2 +++ b/lemon/hao_orlin.h	Mon Oct 30 16:26:13 2006 +0000
     1.3 @@ -630,10 +630,11 @@
     1.4  
     1.5      /// @}
     1.6      
     1.7 -    /// \name Query Functions The result of the %HaoOrlin algorithm
     1.8 +    /// \name Query Functions 
     1.9 +    /// The result of the %HaoOrlin algorithm
    1.10      /// can be obtained using these functions.
    1.11      /// \n
    1.12 -    /// Before the use of these functions, either \ref run(), \ref
    1.13 +    /// Before using these functions, either \ref run(), \ref
    1.14      /// calculateOut() or \ref calculateIn() must be called.
    1.15      
    1.16      /// @{
    1.17 @@ -651,7 +652,7 @@
    1.18      /// Sets \c nodeMap to the characteristic vector of a minimum
    1.19      /// value cut: it will give a nonempty set \f$ X\subsetneq V \f$
    1.20      /// with minimal out-degree (i.e. \c nodeMap will be true exactly
    1.21 -    /// for the nodes of \f$ X \f$.  \pre nodeMap should be a
    1.22 +    /// for the nodes of \f$ X \f$).  \pre nodeMap should be a
    1.23      /// bool-valued node-map.
    1.24      template <typename NodeMap>
    1.25      Value minCut(NodeMap& nodeMap) const {