COIN-OR::LEMON - Graph Library

Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/gomory_hu.h

    r596 r786  
    295295    /// \pre \ref run() must be called before using this function.
    296296    template <typename CutMap>
    297     Value minCutMap(const Node& s, ///<
     297    Value minCutMap(const Node& s,
    298298                    const Node& t,
    299                     ///<
    300299                    CutMap& cutMap
    301                     ///<
    302300                    ) const {
    303301      Node sn = s, tn = t;
     
    360358    /// \c t.
    361359    /// \code
    362     /// GomoruHu<Graph> gom(g, capacities);
     360    /// GomoryHu<Graph> gom(g, capacities);
    363361    /// gom.run();
    364362    /// int cnt=0;
    365     /// for(GomoruHu<Graph>::MinCutNodeIt n(gom,s,t); n!=INVALID; ++n) ++cnt;
     363    /// for(GomoryHu<Graph>::MinCutNodeIt n(gom,s,t); n!=INVALID; ++n) ++cnt;
    366364    /// \endcode
    367365    class MinCutNodeIt
     
    395393                   /// \endcode
    396394                   /// does not necessarily give the same set of nodes.
    397                    /// However it is ensured that
     395                   /// However, it is ensured that
    398396                   /// \code
    399397                   /// MinCutNodeIt(gomory, s, t, true);
     
    457455    /// \c t.
    458456    /// \code
    459     /// GomoruHu<Graph> gom(g, capacities);
     457    /// GomoryHu<Graph> gom(g, capacities);
    460458    /// gom.run();
    461459    /// int value=0;
    462     /// for(GomoruHu<Graph>::MinCutEdgeIt e(gom,s,t); e!=INVALID; ++e)
     460    /// for(GomoryHu<Graph>::MinCutEdgeIt e(gom,s,t); e!=INVALID; ++e)
    463461    ///   value+=capacities[e];
    464462    /// \endcode
Note: See TracChangeset for help on using the changeset viewer.