1.1 --- a/lemon/gomory_hu.h	Thu Aug 20 20:34:30 2009 +0200
     1.2 +++ b/lemon/gomory_hu.h	Fri Sep 25 09:33:09 2009 +0200
     1.3 @@ -359,10 +359,10 @@
     1.4      /// This example counts the nodes in the minimum cut separating \c s from
     1.5      /// \c t.
     1.6      /// \code
     1.7 -    /// GomoruHu<Graph> gom(g, capacities);
     1.8 +    /// GomoryHu<Graph> gom(g, capacities);
     1.9      /// gom.run();
    1.10      /// int cnt=0;
    1.11 -    /// for(GomoruHu<Graph>::MinCutNodeIt n(gom,s,t); n!=INVALID; ++n) ++cnt;
    1.12 +    /// for(GomoryHu<Graph>::MinCutNodeIt n(gom,s,t); n!=INVALID; ++n) ++cnt;
    1.13      /// \endcode
    1.14      class MinCutNodeIt
    1.15      {
    1.16 @@ -456,10 +456,10 @@
    1.17      /// This example computes the value of 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 value=0;
    1.24 -    /// for(GomoruHu<Graph>::MinCutEdgeIt e(gom,s,t); e!=INVALID; ++e)
    1.25 +    /// for(GomoryHu<Graph>::MinCutEdgeIt e(gom,s,t); e!=INVALID; ++e)
    1.26      ///   value+=capacities[e];
    1.27      /// \endcode
    1.28      /// The result will be the same as the value returned by