1.1 --- a/lemon/gomory_hu.h	Sun Oct 04 10:15:32 2009 +0200
     1.2 +++ b/lemon/gomory_hu.h	Wed Dec 09 11:14:06 2009 +0100
     1.3 @@ -294,11 +294,9 @@
     1.4      ///
     1.5      /// \pre \ref run() must be called before using this function.
     1.6      template <typename CutMap>
     1.7 -    Value minCutMap(const Node& s, ///< 
     1.8 +    Value minCutMap(const Node& s,
     1.9                      const Node& t,
    1.10 -                    ///< 
    1.11                      CutMap& cutMap
    1.12 -                    ///< 
    1.13                      ) const {
    1.14        Node sn = s, tn = t;
    1.15        bool s_root=false;
    1.16 @@ -359,10 +357,10 @@
    1.17      /// This example counts the nodes in the minimum cut separating \c s from
    1.18      /// \c t.
    1.19      /// \code
    1.20 -    /// GomoruHu<Graph> gom(g, capacities);
    1.21 +    /// GomoryHu<Graph> gom(g, capacities);
    1.22      /// gom.run();
    1.23      /// int cnt=0;
    1.24 -    /// for(GomoruHu<Graph>::MinCutNodeIt n(gom,s,t); n!=INVALID; ++n) ++cnt;
    1.25 +    /// for(GomoryHu<Graph>::MinCutNodeIt n(gom,s,t); n!=INVALID; ++n) ++cnt;
    1.26      /// \endcode
    1.27      class MinCutNodeIt
    1.28      {
    1.29 @@ -394,7 +392,7 @@
    1.30                     /// MinCutNodeIt(gomory, t, s, false);
    1.31                     /// \endcode
    1.32                     /// does not necessarily give the same set of nodes.
    1.33 -                   /// However it is ensured that
    1.34 +                   /// However, it is ensured that
    1.35                     /// \code
    1.36                     /// MinCutNodeIt(gomory, s, t, true);
    1.37                     /// \endcode
    1.38 @@ -456,10 +454,10 @@
    1.39      /// This example computes the value of the minimum cut separating \c s from
    1.40      /// \c t.
    1.41      /// \code
    1.42 -    /// GomoruHu<Graph> gom(g, capacities);
    1.43 +    /// GomoryHu<Graph> gom(g, capacities);
    1.44      /// gom.run();
    1.45      /// int value=0;
    1.46 -    /// for(GomoruHu<Graph>::MinCutEdgeIt e(gom,s,t); e!=INVALID; ++e)
    1.47 +    /// for(GomoryHu<Graph>::MinCutEdgeIt e(gom,s,t); e!=INVALID; ++e)
    1.48      ///   value+=capacities[e];
    1.49      /// \endcode
    1.50      /// The result will be the same as the value returned by